/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:34:59,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:34:59,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:34:59,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:34:59,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:34:59,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:34:59,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:34:59,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:34:59,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:34:59,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:34:59,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:34:59,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:34:59,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:34:59,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:34:59,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:34:59,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:34:59,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:34:59,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:34:59,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:34:59,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:34:59,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:35:00,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:35:00,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:35:00,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:35:00,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:35:00,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:35:00,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:35:00,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:35:00,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:35:00,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:35:00,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:35:00,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:35:00,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:35:00,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:35:00,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:35:00,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:35:00,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:35:00,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:35:00,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:35:00,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:35:00,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:35:00,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 02:35:00,033 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:35:00,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:35:00,034 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:35:00,034 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:35:00,034 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:35:00,034 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:35:00,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:35:00,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:35:00,035 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:35:00,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:35:00,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:35:00,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:35:00,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:35:00,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:35:00,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:35:00,037 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:35:00,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:35:00,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:35:00,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:35:00,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:35:00,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:35:00,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:35:00,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:35:00,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:35:00,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:35:00,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 02:35:00,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 02:35:00,039 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:35:00,039 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:35:00,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:35:00,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 02:35:00,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:35:00,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:35:00,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:35:00,266 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:35:00,266 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:35:00,268 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c [2022-01-10 02:35:00,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d49e54df/052c57bbfb1e4345b5f383c58864d51c/FLAGe60d1b24a [2022-01-10 02:35:00,792 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:35:00,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c [2022-01-10 02:35:00,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d49e54df/052c57bbfb1e4345b5f383c58864d51c/FLAGe60d1b24a [2022-01-10 02:35:00,831 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d49e54df/052c57bbfb1e4345b5f383c58864d51c [2022-01-10 02:35:00,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:35:00,835 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:35:00,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:35:00,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:35:00,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:35:00,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:35:00" (1/1) ... [2022-01-10 02:35:00,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46139c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:00, skipping insertion in model container [2022-01-10 02:35:00,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:35:00" (1/1) ... [2022-01-10 02:35:00,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:35:00,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:35:01,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c[914,927] [2022-01-10 02:35:01,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c[7115,7128] [2022-01-10 02:35:01,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:35:01,219 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:35:01,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c[914,927] [2022-01-10 02:35:01,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c[7115,7128] [2022-01-10 02:35:01,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:35:01,345 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:35:01,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:01 WrapperNode [2022-01-10 02:35:01,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:35:01,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:35:01,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:35:01,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:35:01,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:01" (1/1) ... [2022-01-10 02:35:01,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:01" (1/1) ... [2022-01-10 02:35:01,420 INFO L137 Inliner]: procedures = 77, calls = 93, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1040 [2022-01-10 02:35:01,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:35:01,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:35:01,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:35:01,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:35:01,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:01" (1/1) ... [2022-01-10 02:35:01,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:01" (1/1) ... [2022-01-10 02:35:01,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:01" (1/1) ... [2022-01-10 02:35:01,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:01" (1/1) ... [2022-01-10 02:35:01,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:01" (1/1) ... [2022-01-10 02:35:01,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:01" (1/1) ... [2022-01-10 02:35:01,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:01" (1/1) ... [2022-01-10 02:35:01,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:35:01,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:35:01,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:35:01,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:35:01,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:01" (1/1) ... [2022-01-10 02:35:01,511 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:35:01,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:35:01,540 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) [2022-01-10 02:35:01,566 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 [2022-01-10 02:35:01,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:35:01,586 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 02:35:01,586 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 02:35:01,586 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-01-10 02:35:01,587 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-01-10 02:35:01,587 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-01-10 02:35:01,587 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-01-10 02:35:01,587 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-01-10 02:35:01,588 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-01-10 02:35:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-01-10 02:35:01,589 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-01-10 02:35:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-01-10 02:35:01,589 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-01-10 02:35:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-01-10 02:35:01,589 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-01-10 02:35:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-01-10 02:35:01,589 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-01-10 02:35:01,589 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-01-10 02:35:01,590 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-01-10 02:35:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-01-10 02:35:01,590 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-01-10 02:35:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-01-10 02:35:01,590 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-01-10 02:35:01,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 02:35:01,591 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-01-10 02:35:01,591 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-01-10 02:35:01,591 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-01-10 02:35:01,591 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-01-10 02:35:01,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:35:01,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:35:01,591 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-01-10 02:35:01,591 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-01-10 02:35:01,777 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:35:01,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:35:02,485 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:35:02,499 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:35:02,499 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2022-01-10 02:35:02,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:35:02 BoogieIcfgContainer [2022-01-10 02:35:02,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:35:02,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:35:02,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:35:02,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:35:02,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:35:00" (1/3) ... [2022-01-10 02:35:02,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656fa0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:35:02, skipping insertion in model container [2022-01-10 02:35:02,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:35:01" (2/3) ... [2022-01-10 02:35:02,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656fa0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:35:02, skipping insertion in model container [2022-01-10 02:35:02,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:35:02" (3/3) ... [2022-01-10 02:35:02,509 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.12.cil-2.c [2022-01-10 02:35:02,517 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:35:02,517 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 02:35:02,561 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:35:02,567 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 02:35:02,567 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 02:35:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 483 states, 426 states have (on average 1.6408450704225352) internal successors, (699), 432 states have internal predecessors, (699), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-01-10 02:35:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:35:02,604 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:02,605 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:35:02,605 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:02,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:02,610 INFO L85 PathProgramCache]: Analyzing trace with hash -353968614, now seen corresponding path program 1 times [2022-01-10 02:35:02,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:02,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656299154] [2022-01-10 02:35:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:02,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:02,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:02,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:02,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:02,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:02,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:03,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:03,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:03,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656299154] [2022-01-10 02:35:03,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656299154] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:03,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:03,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:35:03,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316931804] [2022-01-10 02:35:03,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:03,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:35:03,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:03,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:35:03,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:35:03,061 INFO L87 Difference]: Start difference. First operand has 483 states, 426 states have (on average 1.6408450704225352) internal successors, (699), 432 states have internal predecessors, (699), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:35:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:04,432 INFO L93 Difference]: Finished difference Result 1073 states and 1716 transitions. [2022-01-10 02:35:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:35:04,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-10 02:35:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:04,456 INFO L225 Difference]: With dead ends: 1073 [2022-01-10 02:35:04,457 INFO L226 Difference]: Without dead ends: 608 [2022-01-10 02:35:04,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:35:04,469 INFO L933 BasicCegarLoop]: 740 mSDtfsCounter, 853 mSDsluCounter, 2045 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:04,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [858 Valid, 2785 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 02:35:04,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-01-10 02:35:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 569. [2022-01-10 02:35:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 500 states have internal predecessors, (754), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-01-10 02:35:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 859 transitions. [2022-01-10 02:35:04,551 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 859 transitions. Word has length 65 [2022-01-10 02:35:04,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:04,551 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 859 transitions. [2022-01-10 02:35:04,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:35:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 859 transitions. [2022-01-10 02:35:04,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:35:04,555 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:04,555 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:35:04,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 02:35:04,556 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:04,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:04,556 INFO L85 PathProgramCache]: Analyzing trace with hash 49817337, now seen corresponding path program 1 times [2022-01-10 02:35:04,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:04,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394924065] [2022-01-10 02:35:04,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:04,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:04,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:04,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:04,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:04,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:04,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:04,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:04,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:04,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:04,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394924065] [2022-01-10 02:35:04,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394924065] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:04,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:04,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:35:04,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910048995] [2022-01-10 02:35:04,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:04,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:35:04,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:04,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:35:04,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:35:04,680 INFO L87 Difference]: Start difference. First operand 569 states and 859 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:35:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:05,789 INFO L93 Difference]: Finished difference Result 916 states and 1336 transitions. [2022-01-10 02:35:05,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:35:05,789 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-10 02:35:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:05,797 INFO L225 Difference]: With dead ends: 916 [2022-01-10 02:35:05,798 INFO L226 Difference]: Without dead ends: 739 [2022-01-10 02:35:05,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-01-10 02:35:05,800 INFO L933 BasicCegarLoop]: 775 mSDtfsCounter, 1816 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1848 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:05,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1848 Valid, 2317 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 02:35:05,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-01-10 02:35:05,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 665. [2022-01-10 02:35:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 570 states have (on average 1.5052631578947369) internal successors, (858), 578 states have internal predecessors, (858), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-01-10 02:35:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 993 transitions. [2022-01-10 02:35:05,841 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 993 transitions. Word has length 65 [2022-01-10 02:35:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:05,841 INFO L470 AbstractCegarLoop]: Abstraction has 665 states and 993 transitions. [2022-01-10 02:35:05,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:35:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 993 transitions. [2022-01-10 02:35:05,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:35:05,845 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:05,845 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:35:05,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 02:35:05,845 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:05,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:05,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1978768773, now seen corresponding path program 1 times [2022-01-10 02:35:05,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:05,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487184649] [2022-01-10 02:35:05,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:05,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:05,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:05,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:05,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:05,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:05,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:05,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:05,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:06,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:06,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487184649] [2022-01-10 02:35:06,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487184649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:06,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:06,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:35:06,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085440604] [2022-01-10 02:35:06,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:06,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:35:06,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:06,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:35:06,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:35:06,004 INFO L87 Difference]: Start difference. First operand 665 states and 993 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:35:07,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:07,124 INFO L93 Difference]: Finished difference Result 966 states and 1407 transitions. [2022-01-10 02:35:07,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:35:07,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-01-10 02:35:07,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:07,129 INFO L225 Difference]: With dead ends: 966 [2022-01-10 02:35:07,129 INFO L226 Difference]: Without dead ends: 699 [2022-01-10 02:35:07,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:35:07,131 INFO L933 BasicCegarLoop]: 715 mSDtfsCounter, 968 mSDsluCounter, 2113 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:07,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [969 Valid, 2828 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 02:35:07,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-01-10 02:35:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 670. [2022-01-10 02:35:07,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 574 states have (on average 1.4982578397212543) internal successors, (860), 582 states have internal predecessors, (860), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-01-10 02:35:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 996 transitions. [2022-01-10 02:35:07,160 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 996 transitions. Word has length 65 [2022-01-10 02:35:07,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:07,161 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 996 transitions. [2022-01-10 02:35:07,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:35:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 996 transitions. [2022-01-10 02:35:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:35:07,163 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:07,164 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:35:07,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 02:35:07,164 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:07,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:07,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1286839225, now seen corresponding path program 1 times [2022-01-10 02:35:07,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:07,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548338465] [2022-01-10 02:35:07,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:07,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:07,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:07,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:07,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:07,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:07,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:07,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:07,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:07,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548338465] [2022-01-10 02:35:07,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548338465] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:07,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:07,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 02:35:07,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323014693] [2022-01-10 02:35:07,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:07,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:35:07,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:07,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:35:07,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:35:07,272 INFO L87 Difference]: Start difference. First operand 670 states and 996 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:35:09,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:09,091 INFO L93 Difference]: Finished difference Result 1992 states and 2792 transitions. [2022-01-10 02:35:09,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-10 02:35:09,091 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-01-10 02:35:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:09,099 INFO L225 Difference]: With dead ends: 1992 [2022-01-10 02:35:09,099 INFO L226 Difference]: Without dead ends: 1702 [2022-01-10 02:35:09,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 02:35:09,102 INFO L933 BasicCegarLoop]: 817 mSDtfsCounter, 4037 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 705 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4051 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 705 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:09,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4051 Valid, 2577 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [705 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-10 02:35:09,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2022-01-10 02:35:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1571. [2022-01-10 02:35:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1289 states have (on average 1.395655546935609) internal successors, (1799), 1312 states have internal predecessors, (1799), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-01-10 02:35:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2137 transitions. [2022-01-10 02:35:09,185 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2137 transitions. Word has length 65 [2022-01-10 02:35:09,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:09,186 INFO L470 AbstractCegarLoop]: Abstraction has 1571 states and 2137 transitions. [2022-01-10 02:35:09,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:35:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2137 transitions. [2022-01-10 02:35:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:35:09,187 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:09,188 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:35:09,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 02:35:09,188 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:09,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash 880048655, now seen corresponding path program 1 times [2022-01-10 02:35:09,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:09,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370219138] [2022-01-10 02:35:09,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:09,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:09,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:09,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:09,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:09,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:09,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:09,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:09,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:09,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:09,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370219138] [2022-01-10 02:35:09,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370219138] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:09,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:09,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:35:09,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284005153] [2022-01-10 02:35:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:09,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:35:09,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:09,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:35:09,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:35:09,331 INFO L87 Difference]: Start difference. First operand 1571 states and 2137 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:35:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:10,433 INFO L93 Difference]: Finished difference Result 2862 states and 3810 transitions. [2022-01-10 02:35:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:35:10,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-01-10 02:35:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:10,441 INFO L225 Difference]: With dead ends: 2862 [2022-01-10 02:35:10,441 INFO L226 Difference]: Without dead ends: 1677 [2022-01-10 02:35:10,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:35:10,449 INFO L933 BasicCegarLoop]: 710 mSDtfsCounter, 969 mSDsluCounter, 2113 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 2823 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:10,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [971 Valid, 2823 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 02:35:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2022-01-10 02:35:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1601. [2022-01-10 02:35:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1313 states have (on average 1.3823305407463824) internal successors, (1815), 1336 states have internal predecessors, (1815), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-01-10 02:35:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2159 transitions. [2022-01-10 02:35:10,525 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2159 transitions. Word has length 65 [2022-01-10 02:35:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:10,525 INFO L470 AbstractCegarLoop]: Abstraction has 1601 states and 2159 transitions. [2022-01-10 02:35:10,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:35:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2159 transitions. [2022-01-10 02:35:10,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:35:10,527 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:10,527 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:35:10,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 02:35:10,528 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:10,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2028715247, now seen corresponding path program 1 times [2022-01-10 02:35:10,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:10,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747084535] [2022-01-10 02:35:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:10,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:10,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:10,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:10,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:10,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:10,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:10,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:10,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:10,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:10,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747084535] [2022-01-10 02:35:10,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747084535] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:10,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:10,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:35:10,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348567841] [2022-01-10 02:35:10,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:10,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:35:10,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:10,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:35:10,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:35:10,635 INFO L87 Difference]: Start difference. First operand 1601 states and 2159 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:35:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:11,647 INFO L93 Difference]: Finished difference Result 2856 states and 3706 transitions. [2022-01-10 02:35:11,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:35:11,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-10 02:35:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:11,658 INFO L225 Difference]: With dead ends: 2856 [2022-01-10 02:35:11,658 INFO L226 Difference]: Without dead ends: 1864 [2022-01-10 02:35:11,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-01-10 02:35:11,664 INFO L933 BasicCegarLoop]: 719 mSDtfsCounter, 1778 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:11,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1807 Valid, 2100 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:35:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-01-10 02:35:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1543. [2022-01-10 02:35:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1271 states have (on average 1.3800157356412275) internal successors, (1754), 1289 states have internal predecessors, (1754), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-01-10 02:35:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2077 transitions. [2022-01-10 02:35:11,730 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2077 transitions. Word has length 65 [2022-01-10 02:35:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:11,732 INFO L470 AbstractCegarLoop]: Abstraction has 1543 states and 2077 transitions. [2022-01-10 02:35:11,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:35:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2077 transitions. [2022-01-10 02:35:11,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:35:11,733 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:11,733 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:35:11,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 02:35:11,734 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2132238543, now seen corresponding path program 1 times [2022-01-10 02:35:11,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:11,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652687109] [2022-01-10 02:35:11,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:11,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:11,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:11,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:11,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:11,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:11,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:11,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:11,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:11,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:11,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652687109] [2022-01-10 02:35:11,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652687109] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:11,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:11,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:11,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810321338] [2022-01-10 02:35:11,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:11,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:11,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:11,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:11,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:11,818 INFO L87 Difference]: Start difference. First operand 1543 states and 2077 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:35:12,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:12,301 INFO L93 Difference]: Finished difference Result 3882 states and 5038 transitions. [2022-01-10 02:35:12,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:35:12,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-10 02:35:12,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:12,315 INFO L225 Difference]: With dead ends: 3882 [2022-01-10 02:35:12,315 INFO L226 Difference]: Without dead ends: 2726 [2022-01-10 02:35:12,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-01-10 02:35:12,322 INFO L933 BasicCegarLoop]: 692 mSDtfsCounter, 1400 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1433 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:12,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1433 Valid, 2051 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:35:12,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2022-01-10 02:35:12,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2606. [2022-01-10 02:35:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2606 states, 2091 states have (on average 1.31324725011956) internal successors, (2746), 2126 states have internal predecessors, (2746), 263 states have call successors, (263), 205 states have call predecessors, (263), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2022-01-10 02:35:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 3379 transitions. [2022-01-10 02:35:12,432 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 3379 transitions. Word has length 65 [2022-01-10 02:35:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:12,432 INFO L470 AbstractCegarLoop]: Abstraction has 2606 states and 3379 transitions. [2022-01-10 02:35:12,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:35:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3379 transitions. [2022-01-10 02:35:12,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 02:35:12,437 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:12,437 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:35:12,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 02:35:12,438 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:12,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:12,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1937549811, now seen corresponding path program 1 times [2022-01-10 02:35:12,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:12,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155523788] [2022-01-10 02:35:12,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:12,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:12,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:12,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:12,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:12,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:12,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:12,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:12,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:12,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:12,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155523788] [2022-01-10 02:35:12,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155523788] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:12,521 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:12,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:35:12,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38900388] [2022-01-10 02:35:12,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:12,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:35:12,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:12,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:35:12,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:35:12,522 INFO L87 Difference]: Start difference. First operand 2606 states and 3379 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:35:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:13,266 INFO L93 Difference]: Finished difference Result 5922 states and 7524 transitions. [2022-01-10 02:35:13,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:35:13,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-01-10 02:35:13,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:13,291 INFO L225 Difference]: With dead ends: 5922 [2022-01-10 02:35:13,291 INFO L226 Difference]: Without dead ends: 3708 [2022-01-10 02:35:13,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:35:13,298 INFO L933 BasicCegarLoop]: 721 mSDtfsCounter, 826 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:13,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [835 Valid, 2036 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:35:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2022-01-10 02:35:13,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 3440. [2022-01-10 02:35:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3440 states, 2739 states have (on average 1.2928075940124133) internal successors, (3541), 2779 states have internal predecessors, (3541), 355 states have call successors, (355), 285 states have call predecessors, (355), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2022-01-10 02:35:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 4380 transitions. [2022-01-10 02:35:13,464 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 4380 transitions. Word has length 66 [2022-01-10 02:35:13,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:13,464 INFO L470 AbstractCegarLoop]: Abstraction has 3440 states and 4380 transitions. [2022-01-10 02:35:13,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:35:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 4380 transitions. [2022-01-10 02:35:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 02:35:13,466 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:13,466 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:35:13,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 02:35:13,466 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:13,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:13,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1977597300, now seen corresponding path program 1 times [2022-01-10 02:35:13,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:13,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035091341] [2022-01-10 02:35:13,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:13,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:13,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:13,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:13,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:13,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:13,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:13,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:13,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:13,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:13,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035091341] [2022-01-10 02:35:13,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035091341] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:13,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:13,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:35:13,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515697576] [2022-01-10 02:35:13,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:13,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:35:13,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:13,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:35:13,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:35:13,532 INFO L87 Difference]: Start difference. First operand 3440 states and 4380 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:35:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:13,998 INFO L93 Difference]: Finished difference Result 7312 states and 9154 transitions. [2022-01-10 02:35:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:35:13,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-01-10 02:35:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:14,017 INFO L225 Difference]: With dead ends: 7312 [2022-01-10 02:35:14,017 INFO L226 Difference]: Without dead ends: 4262 [2022-01-10 02:35:14,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:35:14,025 INFO L933 BasicCegarLoop]: 738 mSDtfsCounter, 1722 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:14,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1756 Valid, 1454 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:35:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2022-01-10 02:35:14,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 3994. [2022-01-10 02:35:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3994 states, 3179 states have (on average 1.2837370242214532) internal successors, (4081), 3223 states have internal predecessors, (4081), 411 states have call successors, (411), 335 states have call predecessors, (411), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2022-01-10 02:35:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 5049 transitions. [2022-01-10 02:35:14,192 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 5049 transitions. Word has length 72 [2022-01-10 02:35:14,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:14,194 INFO L470 AbstractCegarLoop]: Abstraction has 3994 states and 5049 transitions. [2022-01-10 02:35:14,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 02:35:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 5049 transitions. [2022-01-10 02:35:14,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 02:35:14,196 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:14,196 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:14,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 02:35:14,196 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:14,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1692903955, now seen corresponding path program 1 times [2022-01-10 02:35:14,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:14,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517881032] [2022-01-10 02:35:14,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:14,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:14,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:14,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:14,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:14,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:14,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:14,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:14,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517881032] [2022-01-10 02:35:14,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517881032] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:14,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:14,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:14,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872500495] [2022-01-10 02:35:14,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:14,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:14,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:14,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:14,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:14,283 INFO L87 Difference]: Start difference. First operand 3994 states and 5049 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 02:35:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:14,892 INFO L93 Difference]: Finished difference Result 5080 states and 6344 transitions. [2022-01-10 02:35:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:35:14,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-01-10 02:35:14,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:14,912 INFO L225 Difference]: With dead ends: 5080 [2022-01-10 02:35:14,912 INFO L226 Difference]: Without dead ends: 5077 [2022-01-10 02:35:14,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-01-10 02:35:14,916 INFO L933 BasicCegarLoop]: 733 mSDtfsCounter, 2062 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2072 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:14,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2072 Valid, 1766 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:35:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5077 states. [2022-01-10 02:35:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5077 to 4456. [2022-01-10 02:35:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4456 states, 3534 states have (on average 1.272495755517827) internal successors, (4497), 3581 states have internal predecessors, (4497), 461 states have call successors, (461), 379 states have call predecessors, (461), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2022-01-10 02:35:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4456 states to 4456 states and 5592 transitions. [2022-01-10 02:35:15,151 INFO L78 Accepts]: Start accepts. Automaton has 4456 states and 5592 transitions. Word has length 73 [2022-01-10 02:35:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:15,151 INFO L470 AbstractCegarLoop]: Abstraction has 4456 states and 5592 transitions. [2022-01-10 02:35:15,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 02:35:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4456 states and 5592 transitions. [2022-01-10 02:35:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-10 02:35:15,154 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:15,154 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:15,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 02:35:15,154 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:15,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:15,155 INFO L85 PathProgramCache]: Analyzing trace with hash -941848842, now seen corresponding path program 1 times [2022-01-10 02:35:15,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:15,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401091465] [2022-01-10 02:35:15,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:15,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:15,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:15,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:15,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:15,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:15,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:15,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:15,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:15,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:15,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:15,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401091465] [2022-01-10 02:35:15,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401091465] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:35:15,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823333855] [2022-01-10 02:35:15,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:15,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:35:15,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:35:15,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:35:15,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 02:35:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:15,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 02:35:15,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:35:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:15,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:35:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:16,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823333855] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:35:16,099 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 02:35:16,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-01-10 02:35:16,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799494526] [2022-01-10 02:35:16,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 02:35:16,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:35:16,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:16,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:35:16,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:35:16,101 INFO L87 Difference]: Start difference. First operand 4456 states and 5592 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-01-10 02:35:17,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:17,955 INFO L93 Difference]: Finished difference Result 8774 states and 10801 transitions. [2022-01-10 02:35:17,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-10 02:35:17,956 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-01-10 02:35:17,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:17,991 INFO L225 Difference]: With dead ends: 8774 [2022-01-10 02:35:17,992 INFO L226 Difference]: Without dead ends: 8771 [2022-01-10 02:35:17,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2022-01-10 02:35:17,996 INFO L933 BasicCegarLoop]: 885 mSDtfsCounter, 2932 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2996 SdHoareTripleChecker+Valid, 2447 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:17,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2996 Valid, 2447 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 02:35:18,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8771 states. [2022-01-10 02:35:18,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8771 to 7873. [2022-01-10 02:35:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7873 states, 6209 states have (on average 1.2530198099532937) internal successors, (7780), 6291 states have internal predecessors, (7780), 820 states have call successors, (820), 693 states have call predecessors, (820), 842 states have return successors, (1135), 891 states have call predecessors, (1135), 819 states have call successors, (1135) [2022-01-10 02:35:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7873 states to 7873 states and 9735 transitions. [2022-01-10 02:35:18,402 INFO L78 Accepts]: Start accepts. Automaton has 7873 states and 9735 transitions. Word has length 74 [2022-01-10 02:35:18,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:18,403 INFO L470 AbstractCegarLoop]: Abstraction has 7873 states and 9735 transitions. [2022-01-10 02:35:18,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-01-10 02:35:18,403 INFO L276 IsEmpty]: Start isEmpty. Operand 7873 states and 9735 transitions. [2022-01-10 02:35:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-10 02:35:18,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:18,404 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:18,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 02:35:18,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-10 02:35:18,624 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1219556691, now seen corresponding path program 2 times [2022-01-10 02:35:18,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:18,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034697766] [2022-01-10 02:35:18,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:18,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:18,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:18,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:18,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:18,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:18,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:18,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:18,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:18,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:18,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034697766] [2022-01-10 02:35:18,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034697766] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:18,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:18,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:35:18,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66946072] [2022-01-10 02:35:18,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:18,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:35:18,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:18,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:35:18,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:35:18,690 INFO L87 Difference]: Start difference. First operand 7873 states and 9735 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 02:35:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:19,245 INFO L93 Difference]: Finished difference Result 10467 states and 12944 transitions. [2022-01-10 02:35:19,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:35:19,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-01-10 02:35:19,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:19,259 INFO L225 Difference]: With dead ends: 10467 [2022-01-10 02:35:19,260 INFO L226 Difference]: Without dead ends: 4293 [2022-01-10 02:35:19,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:35:19,273 INFO L933 BasicCegarLoop]: 764 mSDtfsCounter, 1625 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:19,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1661 Valid, 1501 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:35:19,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2022-01-10 02:35:19,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 3285. [2022-01-10 02:35:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3285 states, 2627 states have (on average 1.2679862961553103) internal successors, (3331), 2655 states have internal predecessors, (3331), 339 states have call successors, (339), 275 states have call predecessors, (339), 317 states have return successors, (434), 357 states have call predecessors, (434), 338 states have call successors, (434) [2022-01-10 02:35:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 4104 transitions. [2022-01-10 02:35:19,491 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 4104 transitions. Word has length 77 [2022-01-10 02:35:19,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:19,491 INFO L470 AbstractCegarLoop]: Abstraction has 3285 states and 4104 transitions. [2022-01-10 02:35:19,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-10 02:35:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 4104 transitions. [2022-01-10 02:35:19,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 02:35:19,492 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:19,493 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 02:35:19,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 02:35:19,493 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:19,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:19,493 INFO L85 PathProgramCache]: Analyzing trace with hash 167337032, now seen corresponding path program 1 times [2022-01-10 02:35:19,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:19,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244396582] [2022-01-10 02:35:19,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:19,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:19,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:19,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:19,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:19,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:19,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:19,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:19,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:19,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 02:35:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 02:35:19,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:19,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244396582] [2022-01-10 02:35:19,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244396582] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:19,572 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:19,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:35:19,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154923965] [2022-01-10 02:35:19,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:19,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:35:19,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:35:19,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:35:19,574 INFO L87 Difference]: Start difference. First operand 3285 states and 4104 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 02:35:20,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:20,833 INFO L93 Difference]: Finished difference Result 9069 states and 11101 transitions. [2022-01-10 02:35:20,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 02:35:20,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-01-10 02:35:20,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:20,855 INFO L225 Difference]: With dead ends: 9069 [2022-01-10 02:35:20,855 INFO L226 Difference]: Without dead ends: 5371 [2022-01-10 02:35:20,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-01-10 02:35:20,866 INFO L933 BasicCegarLoop]: 764 mSDtfsCounter, 1485 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 2177 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:20,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1497 Valid, 2177 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:35:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5371 states. [2022-01-10 02:35:21,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5371 to 5111. [2022-01-10 02:35:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5111 states, 4018 states have (on average 1.2297162767546044) internal successors, (4941), 4083 states have internal predecessors, (4941), 539 states have call successors, (539), 447 states have call predecessors, (539), 552 states have return successors, (784), 583 states have call predecessors, (784), 538 states have call successors, (784) [2022-01-10 02:35:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5111 states to 5111 states and 6264 transitions. [2022-01-10 02:35:21,153 INFO L78 Accepts]: Start accepts. Automaton has 5111 states and 6264 transitions. Word has length 84 [2022-01-10 02:35:21,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:21,153 INFO L470 AbstractCegarLoop]: Abstraction has 5111 states and 6264 transitions. [2022-01-10 02:35:21,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 02:35:21,153 INFO L276 IsEmpty]: Start isEmpty. Operand 5111 states and 6264 transitions. [2022-01-10 02:35:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-10 02:35:21,155 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:21,155 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-01-10 02:35:21,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 02:35:21,155 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:21,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:21,156 INFO L85 PathProgramCache]: Analyzing trace with hash -332961557, now seen corresponding path program 1 times [2022-01-10 02:35:21,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:21,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446331133] [2022-01-10 02:35:21,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:21,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:21,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:21,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:21,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:21,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:21,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:21,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:21,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 02:35:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 02:35:21,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:21,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446331133] [2022-01-10 02:35:21,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446331133] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:21,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:21,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:35:21,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490292281] [2022-01-10 02:35:21,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:21,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:35:21,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:21,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:35:21,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:35:21,251 INFO L87 Difference]: Start difference. First operand 5111 states and 6264 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 02:35:22,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:22,549 INFO L93 Difference]: Finished difference Result 8471 states and 10282 transitions. [2022-01-10 02:35:22,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 02:35:22,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-01-10 02:35:22,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:22,563 INFO L225 Difference]: With dead ends: 8471 [2022-01-10 02:35:22,563 INFO L226 Difference]: Without dead ends: 4272 [2022-01-10 02:35:22,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-01-10 02:35:22,573 INFO L933 BasicCegarLoop]: 746 mSDtfsCounter, 2367 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:22,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2406 Valid, 2537 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 02:35:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2022-01-10 02:35:22,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3851. [2022-01-10 02:35:22,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3024 states have (on average 1.2218915343915344) internal successors, (3695), 3077 states have internal predecessors, (3695), 404 states have call successors, (404), 329 states have call predecessors, (404), 421 states have return successors, (553), 447 states have call predecessors, (553), 403 states have call successors, (553) [2022-01-10 02:35:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 4652 transitions. [2022-01-10 02:35:22,789 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 4652 transitions. Word has length 93 [2022-01-10 02:35:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:22,789 INFO L470 AbstractCegarLoop]: Abstraction has 3851 states and 4652 transitions. [2022-01-10 02:35:22,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 02:35:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 4652 transitions. [2022-01-10 02:35:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:35:22,792 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:22,793 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 02:35:22,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 02:35:22,793 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:22,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:22,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1881468012, now seen corresponding path program 1 times [2022-01-10 02:35:22,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:22,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223901644] [2022-01-10 02:35:22,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:22,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 02:35:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 02:35:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:35:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 02:35:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:35:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-10 02:35:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-10 02:35:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-01-10 02:35:22,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:22,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223901644] [2022-01-10 02:35:22,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223901644] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:35:22,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099431764] [2022-01-10 02:35:22,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:22,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:35:22,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:35:22,926 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:35:22,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 02:35:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:35:23,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:35:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 02:35:23,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:35:23,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099431764] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:23,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:35:23,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-01-10 02:35:23,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662127247] [2022-01-10 02:35:23,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:23,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:35:23,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:23,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:35:23,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:35:23,265 INFO L87 Difference]: Start difference. First operand 3851 states and 4652 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-01-10 02:35:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:23,392 INFO L93 Difference]: Finished difference Result 5726 states and 6891 transitions. [2022-01-10 02:35:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:35:23,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2022-01-10 02:35:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:23,400 INFO L225 Difference]: With dead ends: 5726 [2022-01-10 02:35:23,400 INFO L226 Difference]: Without dead ends: 2267 [2022-01-10 02:35:23,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-10 02:35:23,410 INFO L933 BasicCegarLoop]: 724 mSDtfsCounter, 34 mSDsluCounter, 2859 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3583 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:23,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 3583 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:35:23,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2022-01-10 02:35:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2145. [2022-01-10 02:35:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 1764 states have (on average 1.25) internal successors, (2205), 1780 states have internal predecessors, (2205), 193 states have call successors, (193), 143 states have call predecessors, (193), 186 states have return successors, (260), 222 states have call predecessors, (260), 192 states have call successors, (260) [2022-01-10 02:35:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2658 transitions. [2022-01-10 02:35:23,515 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2658 transitions. Word has length 145 [2022-01-10 02:35:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:23,515 INFO L470 AbstractCegarLoop]: Abstraction has 2145 states and 2658 transitions. [2022-01-10 02:35:23,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-01-10 02:35:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2658 transitions. [2022-01-10 02:35:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-01-10 02:35:23,519 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:23,519 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 02:35:23,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 02:35:23,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-10 02:35:23,744 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:23,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2075067146, now seen corresponding path program 1 times [2022-01-10 02:35:23,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:23,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279078363] [2022-01-10 02:35:23,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:23,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 02:35:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-10 02:35:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-10 02:35:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-10 02:35:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-10 02:35:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-01-10 02:35:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-01-10 02:35:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-01-10 02:35:23,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:23,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279078363] [2022-01-10 02:35:23,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279078363] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:23,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:23,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:35:23,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011217848] [2022-01-10 02:35:23,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:23,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:35:23,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:23,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:35:23,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:35:23,835 INFO L87 Difference]: Start difference. First operand 2145 states and 2658 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 02:35:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:24,417 INFO L93 Difference]: Finished difference Result 2193 states and 2708 transitions. [2022-01-10 02:35:24,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:35:24,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2022-01-10 02:35:24,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:24,423 INFO L225 Difference]: With dead ends: 2193 [2022-01-10 02:35:24,423 INFO L226 Difference]: Without dead ends: 1819 [2022-01-10 02:35:24,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:35:24,425 INFO L933 BasicCegarLoop]: 704 mSDtfsCounter, 751 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:24,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [763 Valid, 1966 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:35:24,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2022-01-10 02:35:24,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1774. [2022-01-10 02:35:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1477 states have (on average 1.2721733243060258) internal successors, (1879), 1490 states have internal predecessors, (1879), 152 states have call successors, (152), 108 states have call predecessors, (152), 143 states have return successors, (205), 176 states have call predecessors, (205), 151 states have call successors, (205) [2022-01-10 02:35:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2236 transitions. [2022-01-10 02:35:24,515 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2236 transitions. Word has length 147 [2022-01-10 02:35:24,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:24,515 INFO L470 AbstractCegarLoop]: Abstraction has 1774 states and 2236 transitions. [2022-01-10 02:35:24,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 02:35:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2236 transitions. [2022-01-10 02:35:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 02:35:24,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:24,518 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 02:35:24,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 02:35:24,518 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:24,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:24,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1656557558, now seen corresponding path program 1 times [2022-01-10 02:35:24,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:24,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168829729] [2022-01-10 02:35:24,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:24,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 02:35:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-10 02:35:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-10 02:35:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-10 02:35:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-01-10 02:35:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-01-10 02:35:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-10 02:35:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-01-10 02:35:24,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:24,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168829729] [2022-01-10 02:35:24,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168829729] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:24,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:24,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:24,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048848055] [2022-01-10 02:35:24,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:24,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:24,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:24,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:24,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:24,625 INFO L87 Difference]: Start difference. First operand 1774 states and 2236 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-10 02:35:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:25,360 INFO L93 Difference]: Finished difference Result 3040 states and 3735 transitions. [2022-01-10 02:35:25,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:35:25,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2022-01-10 02:35:25,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:25,365 INFO L225 Difference]: With dead ends: 3040 [2022-01-10 02:35:25,365 INFO L226 Difference]: Without dead ends: 1747 [2022-01-10 02:35:25,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:35:25,368 INFO L933 BasicCegarLoop]: 736 mSDtfsCounter, 679 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 2466 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:25,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [680 Valid, 2466 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:35:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2022-01-10 02:35:25,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1663. [2022-01-10 02:35:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1390 states have (on average 1.2820143884892086) internal successors, (1782), 1403 states have internal predecessors, (1782), 140 states have call successors, (140), 98 states have call predecessors, (140), 131 states have return successors, (187), 162 states have call predecessors, (187), 139 states have call successors, (187) [2022-01-10 02:35:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2109 transitions. [2022-01-10 02:35:25,477 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2109 transitions. Word has length 159 [2022-01-10 02:35:25,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:25,477 INFO L470 AbstractCegarLoop]: Abstraction has 1663 states and 2109 transitions. [2022-01-10 02:35:25,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-10 02:35:25,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2109 transitions. [2022-01-10 02:35:25,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 02:35:25,480 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:25,480 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 02:35:25,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 02:35:25,481 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:25,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:25,481 INFO L85 PathProgramCache]: Analyzing trace with hash -619024488, now seen corresponding path program 1 times [2022-01-10 02:35:25,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:25,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154226819] [2022-01-10 02:35:25,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:25,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:35:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:35:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:35:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:35:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 02:35:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-10 02:35:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-10 02:35:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-01-10 02:35:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:35:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:35:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-01-10 02:35:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-01-10 02:35:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-01-10 02:35:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-10 02:35:25,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:25,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154226819] [2022-01-10 02:35:25,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154226819] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:35:25,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117668600] [2022-01-10 02:35:25,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:25,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:35:25,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:35:25,640 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:35:25,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 02:35:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:25,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 02:35:25,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:35:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-10 02:35:26,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:35:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-01-10 02:35:26,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117668600] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:35:26,562 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 02:35:26,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-01-10 02:35:26,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172117415] [2022-01-10 02:35:26,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 02:35:26,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 02:35:26,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:26,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 02:35:26,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-01-10 02:35:26,564 INFO L87 Difference]: Start difference. First operand 1663 states and 2109 transitions. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-01-10 02:35:27,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:27,979 INFO L93 Difference]: Finished difference Result 3399 states and 4248 transitions. [2022-01-10 02:35:27,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-10 02:35:27,980 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 162 [2022-01-10 02:35:27,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:27,986 INFO L225 Difference]: With dead ends: 3399 [2022-01-10 02:35:27,986 INFO L226 Difference]: Without dead ends: 2054 [2022-01-10 02:35:27,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 354 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2022-01-10 02:35:27,991 INFO L933 BasicCegarLoop]: 671 mSDtfsCounter, 2239 mSDsluCounter, 2073 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2271 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:27,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2271 Valid, 2744 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 02:35:27,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2022-01-10 02:35:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1941. [2022-01-10 02:35:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1593 states have (on average 1.2460765850596358) internal successors, (1985), 1607 states have internal predecessors, (1985), 180 states have call successors, (180), 136 states have call predecessors, (180), 166 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2022-01-10 02:35:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2421 transitions. [2022-01-10 02:35:28,112 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2421 transitions. Word has length 162 [2022-01-10 02:35:28,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:28,112 INFO L470 AbstractCegarLoop]: Abstraction has 1941 states and 2421 transitions. [2022-01-10 02:35:28,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-01-10 02:35:28,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2421 transitions. [2022-01-10 02:35:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-10 02:35:28,114 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:28,115 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:28,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 02:35:28,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-10 02:35:28,316 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:28,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:28,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1512428841, now seen corresponding path program 1 times [2022-01-10 02:35:28,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:28,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712213340] [2022-01-10 02:35:28,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:28,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:28,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 02:35:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:28,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:35:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:28,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-01-10 02:35:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:28,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-01-10 02:35:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:28,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:28,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712213340] [2022-01-10 02:35:28,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712213340] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:28,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:28,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:35:28,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084113634] [2022-01-10 02:35:28,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:28,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:35:28,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:28,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:35:28,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:35:28,470 INFO L87 Difference]: Start difference. First operand 1941 states and 2421 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:30,093 INFO L93 Difference]: Finished difference Result 2451 states and 3247 transitions. [2022-01-10 02:35:30,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:35:30,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2022-01-10 02:35:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:30,099 INFO L225 Difference]: With dead ends: 2451 [2022-01-10 02:35:30,099 INFO L226 Difference]: Without dead ends: 2083 [2022-01-10 02:35:30,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:35:30,102 INFO L933 BasicCegarLoop]: 782 mSDtfsCounter, 1129 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:30,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1153 Valid, 1338 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 02:35:30,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2022-01-10 02:35:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1941. [2022-01-10 02:35:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1593 states have (on average 1.2454488386691775) internal successors, (1984), 1607 states have internal predecessors, (1984), 180 states have call successors, (180), 136 states have call predecessors, (180), 166 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2022-01-10 02:35:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2420 transitions. [2022-01-10 02:35:30,251 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2420 transitions. Word has length 178 [2022-01-10 02:35:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:30,251 INFO L470 AbstractCegarLoop]: Abstraction has 1941 states and 2420 transitions. [2022-01-10 02:35:30,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2420 transitions. [2022-01-10 02:35:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-10 02:35:30,253 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:30,253 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:30,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 02:35:30,254 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:30,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:30,254 INFO L85 PathProgramCache]: Analyzing trace with hash -104702891, now seen corresponding path program 1 times [2022-01-10 02:35:30,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:30,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021969783] [2022-01-10 02:35:30,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:30,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:30,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:30,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 02:35:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:30,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:35:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:30,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-01-10 02:35:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:30,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-01-10 02:35:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:30,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:30,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021969783] [2022-01-10 02:35:30,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021969783] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:30,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:30,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:35:30,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986034123] [2022-01-10 02:35:30,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:30,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:35:30,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:30,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:35:30,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:35:30,395 INFO L87 Difference]: Start difference. First operand 1941 states and 2420 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:31,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:31,965 INFO L93 Difference]: Finished difference Result 2443 states and 3230 transitions. [2022-01-10 02:35:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:35:31,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2022-01-10 02:35:31,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:31,976 INFO L225 Difference]: With dead ends: 2443 [2022-01-10 02:35:31,976 INFO L226 Difference]: Without dead ends: 2083 [2022-01-10 02:35:31,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:35:31,979 INFO L933 BasicCegarLoop]: 781 mSDtfsCounter, 1120 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:31,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1144 Valid, 1336 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 02:35:31,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2022-01-10 02:35:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 1941. [2022-01-10 02:35:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1593 states have (on average 1.2448210922787193) internal successors, (1983), 1607 states have internal predecessors, (1983), 180 states have call successors, (180), 136 states have call predecessors, (180), 166 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2022-01-10 02:35:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2419 transitions. [2022-01-10 02:35:32,141 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2419 transitions. Word has length 178 [2022-01-10 02:35:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:32,142 INFO L470 AbstractCegarLoop]: Abstraction has 1941 states and 2419 transitions. [2022-01-10 02:35:32,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2419 transitions. [2022-01-10 02:35:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-10 02:35:32,144 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:32,144 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:32,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 02:35:32,145 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:32,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash -772084781, now seen corresponding path program 1 times [2022-01-10 02:35:32,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:32,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144606520] [2022-01-10 02:35:32,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:32,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:32,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 02:35:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:32,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:35:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:32,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-01-10 02:35:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:32,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-01-10 02:35:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:32,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:32,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:32,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144606520] [2022-01-10 02:35:32,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144606520] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:32,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:32,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:35:32,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340998078] [2022-01-10 02:35:32,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:32,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:35:32,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:32,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:35:32,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:35:32,307 INFO L87 Difference]: Start difference. First operand 1941 states and 2419 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:34,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:34,997 INFO L93 Difference]: Finished difference Result 2957 states and 4066 transitions. [2022-01-10 02:35:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:35:34,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2022-01-10 02:35:34,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:35,003 INFO L225 Difference]: With dead ends: 2957 [2022-01-10 02:35:35,003 INFO L226 Difference]: Without dead ends: 2600 [2022-01-10 02:35:35,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:35:35,005 INFO L933 BasicCegarLoop]: 821 mSDtfsCounter, 1770 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 2119 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1799 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 2119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:35,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1799 Valid, 1919 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 2119 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-10 02:35:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2022-01-10 02:35:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2317. [2022-01-10 02:35:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 1941 states have (on average 1.3080886141164347) internal successors, (2539), 1956 states have internal predecessors, (2539), 201 states have call successors, (201), 142 states have call predecessors, (201), 173 states have return successors, (280), 219 states have call predecessors, (280), 200 states have call successors, (280) [2022-01-10 02:35:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 3020 transitions. [2022-01-10 02:35:35,157 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 3020 transitions. Word has length 178 [2022-01-10 02:35:35,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:35,157 INFO L470 AbstractCegarLoop]: Abstraction has 2317 states and 3020 transitions. [2022-01-10 02:35:35,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 3020 transitions. [2022-01-10 02:35:35,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-10 02:35:35,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:35,160 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:35,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 02:35:35,161 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:35,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:35,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1648070057, now seen corresponding path program 1 times [2022-01-10 02:35:35,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:35,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704918702] [2022-01-10 02:35:35,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:35,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:35,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:35,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 02:35:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:35,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:35:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:35,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-01-10 02:35:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:35,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-01-10 02:35:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:35,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:35,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704918702] [2022-01-10 02:35:35,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704918702] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:35,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:35,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:35,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482824157] [2022-01-10 02:35:35,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:35,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:35,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:35,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:35,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:35,308 INFO L87 Difference]: Start difference. First operand 2317 states and 3020 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:38,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:38,707 INFO L93 Difference]: Finished difference Result 3872 states and 5546 transitions. [2022-01-10 02:35:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:35:38,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2022-01-10 02:35:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:38,722 INFO L225 Difference]: With dead ends: 3872 [2022-01-10 02:35:38,722 INFO L226 Difference]: Without dead ends: 3139 [2022-01-10 02:35:38,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:35:38,729 INFO L933 BasicCegarLoop]: 1118 mSDtfsCounter, 1803 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 3313 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 3430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:38,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1832 Valid, 3195 Invalid, 3430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3313 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-10 02:35:38,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2022-01-10 02:35:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2667. [2022-01-10 02:35:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2667 states, 2263 states have (on average 1.344675209898365) internal successors, (3043), 2279 states have internal predecessors, (3043), 222 states have call successors, (222), 148 states have call predecessors, (222), 180 states have return successors, (303), 241 states have call predecessors, (303), 221 states have call successors, (303) [2022-01-10 02:35:38,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 3568 transitions. [2022-01-10 02:35:38,988 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 3568 transitions. Word has length 178 [2022-01-10 02:35:38,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:38,988 INFO L470 AbstractCegarLoop]: Abstraction has 2667 states and 3568 transitions. [2022-01-10 02:35:38,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:38,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 3568 transitions. [2022-01-10 02:35:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-10 02:35:38,991 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:38,991 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:38,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 02:35:38,991 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:38,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:38,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1241705561, now seen corresponding path program 1 times [2022-01-10 02:35:38,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:38,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858122632] [2022-01-10 02:35:38,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:38,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:39,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:39,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 02:35:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:39,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:35:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:39,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-01-10 02:35:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:39,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-01-10 02:35:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:39,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:39,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858122632] [2022-01-10 02:35:39,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858122632] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:39,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:39,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:39,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908738299] [2022-01-10 02:35:39,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:39,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:39,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:39,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:39,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:39,153 INFO L87 Difference]: Start difference. First operand 2667 states and 3568 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:40,964 INFO L93 Difference]: Finished difference Result 4240 states and 6134 transitions. [2022-01-10 02:35:40,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:35:40,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2022-01-10 02:35:40,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:40,972 INFO L225 Difference]: With dead ends: 4240 [2022-01-10 02:35:40,972 INFO L226 Difference]: Without dead ends: 3157 [2022-01-10 02:35:40,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:35:40,976 INFO L933 BasicCegarLoop]: 760 mSDtfsCounter, 1333 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:40,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1363 Valid, 1896 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 02:35:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3157 states. [2022-01-10 02:35:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3157 to 2667. [2022-01-10 02:35:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2667 states, 2263 states have (on average 1.3433495360141405) internal successors, (3040), 2279 states have internal predecessors, (3040), 222 states have call successors, (222), 148 states have call predecessors, (222), 180 states have return successors, (303), 241 states have call predecessors, (303), 221 states have call successors, (303) [2022-01-10 02:35:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 3565 transitions. [2022-01-10 02:35:41,197 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 3565 transitions. Word has length 178 [2022-01-10 02:35:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:41,197 INFO L470 AbstractCegarLoop]: Abstraction has 2667 states and 3565 transitions. [2022-01-10 02:35:41,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 3565 transitions. [2022-01-10 02:35:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-10 02:35:41,203 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:41,204 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:41,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 02:35:41,204 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:41,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:41,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1158927849, now seen corresponding path program 1 times [2022-01-10 02:35:41,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:41,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416512651] [2022-01-10 02:35:41,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:41,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:41,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:41,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 02:35:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:41,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:35:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:41,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-01-10 02:35:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:41,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-01-10 02:35:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:41,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:41,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416512651] [2022-01-10 02:35:41,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416512651] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:41,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:41,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:41,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277353760] [2022-01-10 02:35:41,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:41,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:41,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:41,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:41,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:41,355 INFO L87 Difference]: Start difference. First operand 2667 states and 3565 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:43,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:43,142 INFO L93 Difference]: Finished difference Result 4236 states and 6117 transitions. [2022-01-10 02:35:43,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:35:43,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2022-01-10 02:35:43,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:43,149 INFO L225 Difference]: With dead ends: 4236 [2022-01-10 02:35:43,150 INFO L226 Difference]: Without dead ends: 3153 [2022-01-10 02:35:43,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:35:43,155 INFO L933 BasicCegarLoop]: 756 mSDtfsCounter, 1331 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:43,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1361 Valid, 1892 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 02:35:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2022-01-10 02:35:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 2667. [2022-01-10 02:35:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2667 states, 2263 states have (on average 1.342023862129916) internal successors, (3037), 2279 states have internal predecessors, (3037), 222 states have call successors, (222), 148 states have call predecessors, (222), 180 states have return successors, (303), 241 states have call predecessors, (303), 221 states have call successors, (303) [2022-01-10 02:35:43,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 3562 transitions. [2022-01-10 02:35:43,388 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 3562 transitions. Word has length 178 [2022-01-10 02:35:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:43,389 INFO L470 AbstractCegarLoop]: Abstraction has 2667 states and 3562 transitions. [2022-01-10 02:35:43,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:43,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 3562 transitions. [2022-01-10 02:35:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-10 02:35:43,391 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:43,392 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:43,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 02:35:43,392 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:43,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:43,392 INFO L85 PathProgramCache]: Analyzing trace with hash 287653017, now seen corresponding path program 1 times [2022-01-10 02:35:43,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:43,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676276971] [2022-01-10 02:35:43,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:43,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:43,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:43,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 02:35:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:43,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:35:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:43,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-01-10 02:35:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:43,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-01-10 02:35:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:43,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:43,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676276971] [2022-01-10 02:35:43,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676276971] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:43,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:43,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:43,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823548975] [2022-01-10 02:35:43,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:43,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:43,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:43,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:43,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:43,540 INFO L87 Difference]: Start difference. First operand 2667 states and 3562 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:46,813 INFO L93 Difference]: Finished difference Result 5211 states and 7658 transitions. [2022-01-10 02:35:46,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:35:46,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2022-01-10 02:35:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:46,828 INFO L225 Difference]: With dead ends: 5211 [2022-01-10 02:35:46,828 INFO L226 Difference]: Without dead ends: 4128 [2022-01-10 02:35:46,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:35:46,832 INFO L933 BasicCegarLoop]: 1099 mSDtfsCounter, 1785 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 3255 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1814 SdHoareTripleChecker+Valid, 3176 SdHoareTripleChecker+Invalid, 3373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 3255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:46,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1814 Valid, 3176 Invalid, 3373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 3255 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-01-10 02:35:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4128 states. [2022-01-10 02:35:47,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4128 to 3376. [2022-01-10 02:35:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3376 states, 2916 states have (on average 1.3902606310013716) internal successors, (4054), 2934 states have internal predecessors, (4054), 264 states have call successors, (264), 160 states have call predecessors, (264), 194 states have return successors, (353), 285 states have call predecessors, (353), 263 states have call successors, (353) [2022-01-10 02:35:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 4671 transitions. [2022-01-10 02:35:47,136 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 4671 transitions. Word has length 178 [2022-01-10 02:35:47,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:47,137 INFO L470 AbstractCegarLoop]: Abstraction has 3376 states and 4671 transitions. [2022-01-10 02:35:47,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 4671 transitions. [2022-01-10 02:35:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-10 02:35:47,140 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:47,140 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:47,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 02:35:47,140 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:47,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash -635514409, now seen corresponding path program 1 times [2022-01-10 02:35:47,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:47,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700316760] [2022-01-10 02:35:47,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:47,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:47,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:47,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 02:35:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:47,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:35:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:47,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-01-10 02:35:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:47,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-01-10 02:35:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:47,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:47,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700316760] [2022-01-10 02:35:47,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700316760] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:47,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:47,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:47,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341507874] [2022-01-10 02:35:47,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:47,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:47,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:47,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:47,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:47,271 INFO L87 Difference]: Start difference. First operand 3376 states and 4671 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:35:48,939 INFO L93 Difference]: Finished difference Result 5908 states and 8756 transitions. [2022-01-10 02:35:48,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:35:48,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2022-01-10 02:35:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:35:48,953 INFO L225 Difference]: With dead ends: 5908 [2022-01-10 02:35:48,953 INFO L226 Difference]: Without dead ends: 4116 [2022-01-10 02:35:48,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:35:48,960 INFO L933 BasicCegarLoop]: 709 mSDtfsCounter, 1625 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:35:48,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1655 Valid, 1600 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 02:35:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4116 states. [2022-01-10 02:35:49,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4116 to 3376. [2022-01-10 02:35:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3376 states, 2916 states have (on average 1.3885459533607682) internal successors, (4049), 2934 states have internal predecessors, (4049), 264 states have call successors, (264), 160 states have call predecessors, (264), 194 states have return successors, (353), 285 states have call predecessors, (353), 263 states have call successors, (353) [2022-01-10 02:35:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 4666 transitions. [2022-01-10 02:35:49,224 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 4666 transitions. Word has length 178 [2022-01-10 02:35:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:35:49,224 INFO L470 AbstractCegarLoop]: Abstraction has 3376 states and 4666 transitions. [2022-01-10 02:35:49,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:35:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 4666 transitions. [2022-01-10 02:35:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-10 02:35:49,228 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:35:49,228 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:35:49,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 02:35:49,228 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:35:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:35:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash -249652007, now seen corresponding path program 1 times [2022-01-10 02:35:49,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:35:49,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289638192] [2022-01-10 02:35:49,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:35:49,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:35:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:49,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:35:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:49,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 02:35:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:49,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 02:35:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:49,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-01-10 02:35:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:49,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-01-10 02:35:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:35:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:35:49,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:35:49,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289638192] [2022-01-10 02:35:49,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289638192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:35:49,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:35:49,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:35:49,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349979926] [2022-01-10 02:35:49,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:35:49,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:35:49,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:35:49,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:35:49,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:35:49,408 INFO L87 Difference]: Start difference. First operand 3376 states and 4666 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)