/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.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:33:32,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:33:32,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:33:32,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:33:32,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:33:32,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:33:32,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:33:32,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:33:32,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:33:32,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:33:32,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:33:32,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:33:32,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:33:32,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:33:32,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:33:32,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:33:32,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:33:32,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:33:32,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:33:32,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:33:32,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:33:32,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:33:32,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:33:32,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:33:32,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:33:32,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:33:32,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:33:32,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:33:32,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:33:32,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:33:32,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:33:32,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:33:32,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:33:32,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:33:32,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:33:32,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:33:32,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:33:32,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:33:32,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:33:32,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:33:32,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:33:32,372 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:33:32,397 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:33:32,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:33:32,397 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:33:32,398 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:33:32,398 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:33:32,398 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:33:32,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:33:32,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:33:32,399 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:33:32,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:33:32,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:33:32,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:33:32,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:33:32,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:33:32,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:33:32,400 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:33:32,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:33:32,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:33:32,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:33:32,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:33:32,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:33:32,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:33:32,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:33:32,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:33:32,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:33:32,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 02:33:32,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 02:33:32,403 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:33:32,403 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:33:32,403 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:33:32,403 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:33:32,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:33:32,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:33:32,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:33:32,624 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:33:32,625 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:33:32,625 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.01.cil-2.c [2022-01-10 02:33:32,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41152208e/e2021acf829e4e6fbe789e416917d0c8/FLAG3be6ee510 [2022-01-10 02:33:33,074 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:33:33,075 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-01-10 02:33:33,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41152208e/e2021acf829e4e6fbe789e416917d0c8/FLAG3be6ee510 [2022-01-10 02:33:33,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41152208e/e2021acf829e4e6fbe789e416917d0c8 [2022-01-10 02:33:33,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:33:33,097 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:33:33,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:33:33,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:33:33,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:33:33,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:33:33" (1/1) ... [2022-01-10 02:33:33,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619cbcc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:33, skipping insertion in model container [2022-01-10 02:33:33,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:33:33" (1/1) ... [2022-01-10 02:33:33,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:33:33,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:33:33,326 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.01.cil-2.c[914,927] [2022-01-10 02:33:33,389 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.01.cil-2.c[7115,7128] [2022-01-10 02:33:33,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:33:33,432 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:33:33,446 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.01.cil-2.c[914,927] [2022-01-10 02:33:33,474 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.01.cil-2.c[7115,7128] [2022-01-10 02:33:33,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:33:33,504 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:33:33,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:33 WrapperNode [2022-01-10 02:33:33,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:33:33,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:33:33,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:33:33,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:33:33,511 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:33:33" (1/1) ... [2022-01-10 02:33:33,526 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:33:33" (1/1) ... [2022-01-10 02:33:33,560 INFO L137 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 407 [2022-01-10 02:33:33,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:33:33,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:33:33,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:33:33,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:33:33,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:33" (1/1) ... [2022-01-10 02:33:33,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:33" (1/1) ... [2022-01-10 02:33:33,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:33" (1/1) ... [2022-01-10 02:33:33,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:33" (1/1) ... [2022-01-10 02:33:33,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:33" (1/1) ... [2022-01-10 02:33:33,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:33" (1/1) ... [2022-01-10 02:33:33,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:33" (1/1) ... [2022-01-10 02:33:33,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:33:33,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:33:33,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:33:33,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:33:33,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:33" (1/1) ... [2022-01-10 02:33:33,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:33:33,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:33:33,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 02:33:33,665 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:33:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:33:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 02:33:33,680 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 02:33:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-01-10 02:33:33,681 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-01-10 02:33:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-01-10 02:33:33,682 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-01-10 02:33:33,682 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-01-10 02:33:33,687 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-01-10 02:33:33,687 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-01-10 02:33:33,687 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-01-10 02:33:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-01-10 02:33:33,688 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-01-10 02:33:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-01-10 02:33:33,688 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-01-10 02:33:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-01-10 02:33:33,688 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-01-10 02:33:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-01-10 02:33:33,688 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-01-10 02:33:33,688 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-01-10 02:33:33,689 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-01-10 02:33:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-01-10 02:33:33,689 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-01-10 02:33:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 02:33:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-01-10 02:33:33,689 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-01-10 02:33:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-01-10 02:33:33,689 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-01-10 02:33:33,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:33:33,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:33:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-01-10 02:33:33,690 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-01-10 02:33:33,690 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-01-10 02:33:33,690 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-01-10 02:33:33,762 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:33:33,764 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:33:34,245 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:33:34,253 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:33:34,253 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-10 02:33:34,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:33:34 BoogieIcfgContainer [2022-01-10 02:33:34,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:33:34,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:33:34,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:33:34,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:33:34,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:33:33" (1/3) ... [2022-01-10 02:33:34,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0e90a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:33:34, skipping insertion in model container [2022-01-10 02:33:34,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:33:33" (2/3) ... [2022-01-10 02:33:34,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0e90a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:33:34, skipping insertion in model container [2022-01-10 02:33:34,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:33:34" (3/3) ... [2022-01-10 02:33:34,266 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-01-10 02:33:34,271 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:33:34,272 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 02:33:34,319 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:33:34,327 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:33:34,327 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 02:33:34,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-01-10 02:33:34,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 02:33:34,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:34,366 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] [2022-01-10 02:33:34,367 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:34,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:34,372 INFO L85 PathProgramCache]: Analyzing trace with hash 243262796, now seen corresponding path program 1 times [2022-01-10 02:33:34,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:34,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945988748] [2022-01-10 02:33:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:34,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:34,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:34,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:33:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:34,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:33:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:34,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:33:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:34,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:33:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:34,659 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:33:34,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:34,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945988748] [2022-01-10 02:33:34,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945988748] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:34,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:34,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:33:34,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146174242] [2022-01-10 02:33:34,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:34,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:33:34,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:34,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:33:34,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:33:34,697 INFO L87 Difference]: Start difference. First operand has 216 states, 167 states have (on average 1.5449101796407185) internal successors, (258), 175 states have internal predecessors, (258), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:35,398 INFO L93 Difference]: Finished difference Result 552 states and 832 transitions. [2022-01-10 02:33:35,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:33:35,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-01-10 02:33:35,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:35,419 INFO L225 Difference]: With dead ends: 552 [2022-01-10 02:33:35,419 INFO L226 Difference]: Without dead ends: 343 [2022-01-10 02:33:35,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:33:35,426 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 535 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:35,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 794 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:33:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-01-10 02:33:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 300. [2022-01-10 02:33:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 237 states have (on average 1.4556962025316456) internal successors, (345), 243 states have internal predecessors, (345), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-01-10 02:33:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2022-01-10 02:33:35,483 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 58 [2022-01-10 02:33:35,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:35,483 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2022-01-10 02:33:35,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2022-01-10 02:33:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 02:33:35,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:35,486 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] [2022-01-10 02:33:35,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 02:33:35,487 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2037521992, now seen corresponding path program 1 times [2022-01-10 02:33:35,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:35,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196252287] [2022-01-10 02:33:35,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:35,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:35,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:35,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:33:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:35,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:33:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:35,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:33:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:35,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:33:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:35,591 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:33:35,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:35,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196252287] [2022-01-10 02:33:35,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196252287] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:35,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:35,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:35,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563533450] [2022-01-10 02:33:35,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:35,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:35,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:35,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:35,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:35,594 INFO L87 Difference]: Start difference. First operand 300 states and 426 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:36,278 INFO L93 Difference]: Finished difference Result 651 states and 934 transitions. [2022-01-10 02:33:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:33:36,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-01-10 02:33:36,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:36,286 INFO L225 Difference]: With dead ends: 651 [2022-01-10 02:33:36,286 INFO L226 Difference]: Without dead ends: 456 [2022-01-10 02:33:36,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:33:36,295 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 527 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:36,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 918 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:33:36,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-01-10 02:33:36,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 390. [2022-01-10 02:33:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 310 states have (on average 1.4516129032258065) internal successors, (450), 317 states have internal predecessors, (450), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-01-10 02:33:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 553 transitions. [2022-01-10 02:33:36,333 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 553 transitions. Word has length 58 [2022-01-10 02:33:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:36,334 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 553 transitions. [2022-01-10 02:33:36,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 553 transitions. [2022-01-10 02:33:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 02:33:36,336 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:36,336 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] [2022-01-10 02:33:36,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 02:33:36,336 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:36,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:36,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1363958966, now seen corresponding path program 1 times [2022-01-10 02:33:36,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:36,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295241269] [2022-01-10 02:33:36,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:36,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:36,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:36,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:33:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:36,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:33:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:36,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:33:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:36,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:33:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:36,423 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:33:36,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:36,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295241269] [2022-01-10 02:33:36,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295241269] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:36,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:36,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:36,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497538620] [2022-01-10 02:33:36,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:36,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:36,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:36,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:36,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:36,425 INFO L87 Difference]: Start difference. First operand 390 states and 553 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:37,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:37,172 INFO L93 Difference]: Finished difference Result 1002 states and 1431 transitions. [2022-01-10 02:33:37,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:33:37,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-01-10 02:33:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:37,178 INFO L225 Difference]: With dead ends: 1002 [2022-01-10 02:33:37,178 INFO L226 Difference]: Without dead ends: 717 [2022-01-10 02:33:37,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:33:37,180 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 530 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:37,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 1134 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:33:37,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-01-10 02:33:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 565. [2022-01-10 02:33:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 453 states have (on average 1.4503311258278146) internal successors, (657), 462 states have internal predecessors, (657), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-01-10 02:33:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 804 transitions. [2022-01-10 02:33:37,233 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 804 transitions. Word has length 58 [2022-01-10 02:33:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:37,233 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 804 transitions. [2022-01-10 02:33:37,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 804 transitions. [2022-01-10 02:33:37,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 02:33:37,241 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:37,241 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] [2022-01-10 02:33:37,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 02:33:37,243 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:37,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:37,244 INFO L85 PathProgramCache]: Analyzing trace with hash 881620488, now seen corresponding path program 1 times [2022-01-10 02:33:37,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:37,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299786947] [2022-01-10 02:33:37,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:37,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:37,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:37,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:33:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:37,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:33:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:37,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:33:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:37,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:33:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:37,369 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:33:37,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:37,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299786947] [2022-01-10 02:33:37,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299786947] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:37,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:37,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:37,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934418604] [2022-01-10 02:33:37,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:37,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:37,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:37,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:37,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:37,372 INFO L87 Difference]: Start difference. First operand 565 states and 804 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:37,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:37,937 INFO L93 Difference]: Finished difference Result 1182 states and 1716 transitions. [2022-01-10 02:33:37,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:33:37,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-01-10 02:33:37,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:37,943 INFO L225 Difference]: With dead ends: 1182 [2022-01-10 02:33:37,943 INFO L226 Difference]: Without dead ends: 723 [2022-01-10 02:33:37,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-01-10 02:33:37,946 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 271 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:37,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 977 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:33:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-01-10 02:33:37,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 580. [2022-01-10 02:33:37,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 468 states have (on average 1.435897435897436) internal successors, (672), 477 states have internal predecessors, (672), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-01-10 02:33:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 819 transitions. [2022-01-10 02:33:37,980 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 819 transitions. Word has length 58 [2022-01-10 02:33:37,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:37,981 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 819 transitions. [2022-01-10 02:33:37,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 819 transitions. [2022-01-10 02:33:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 02:33:37,982 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:37,982 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] [2022-01-10 02:33:37,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 02:33:37,983 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:37,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:37,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1362362810, now seen corresponding path program 1 times [2022-01-10 02:33:37,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:37,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686601808] [2022-01-10 02:33:37,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:37,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:38,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:38,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:33:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:38,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:33:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:38,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:33:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:38,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:33:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:38,112 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:33:38,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:38,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686601808] [2022-01-10 02:33:38,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686601808] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:38,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:38,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:38,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664214708] [2022-01-10 02:33:38,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:38,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:38,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:38,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:38,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:38,114 INFO L87 Difference]: Start difference. First operand 580 states and 819 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:39,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:39,153 INFO L93 Difference]: Finished difference Result 2468 states and 3598 transitions. [2022-01-10 02:33:39,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-10 02:33:39,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-01-10 02:33:39,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:39,163 INFO L225 Difference]: With dead ends: 2468 [2022-01-10 02:33:39,163 INFO L226 Difference]: Without dead ends: 1994 [2022-01-10 02:33:39,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-01-10 02:33:39,166 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 1041 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:39,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1062 Valid, 955 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 02:33:39,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2022-01-10 02:33:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1739. [2022-01-10 02:33:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1384 states have (on average 1.3858381502890174) internal successors, (1918), 1420 states have internal predecessors, (1918), 210 states have call successors, (210), 129 states have call predecessors, (210), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2022-01-10 02:33:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2431 transitions. [2022-01-10 02:33:39,275 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2431 transitions. Word has length 58 [2022-01-10 02:33:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:39,275 INFO L470 AbstractCegarLoop]: Abstraction has 1739 states and 2431 transitions. [2022-01-10 02:33:39,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:33:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2431 transitions. [2022-01-10 02:33:39,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:33:39,276 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:39,276 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:33:39,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 02:33:39,277 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:39,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:39,277 INFO L85 PathProgramCache]: Analyzing trace with hash -652739814, now seen corresponding path program 1 times [2022-01-10 02:33:39,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:39,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879075677] [2022-01-10 02:33:39,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:39,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:39,344 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:33:39,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:39,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879075677] [2022-01-10 02:33:39,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879075677] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:39,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:39,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:33:39,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545111322] [2022-01-10 02:33:39,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:39,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:33:39,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:39,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:33:39,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:33:39,346 INFO L87 Difference]: Start difference. First operand 1739 states and 2431 transitions. 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:33:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:39,956 INFO L93 Difference]: Finished difference Result 1962 states and 2746 transitions. [2022-01-10 02:33:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:33:39,957 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:33:39,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:39,965 INFO L225 Difference]: With dead ends: 1962 [2022-01-10 02:33:39,965 INFO L226 Difference]: Without dead ends: 1874 [2022-01-10 02:33:39,966 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:33:39,969 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 543 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:39,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 825 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:33:39,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2022-01-10 02:33:40,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1835. [2022-01-10 02:33:40,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1460 states have (on average 1.3856164383561644) internal successors, (2023), 1498 states have internal predecessors, (2023), 221 states have call successors, (221), 136 states have call predecessors, (221), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2022-01-10 02:33:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2563 transitions. [2022-01-10 02:33:40,092 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2563 transitions. Word has length 65 [2022-01-10 02:33:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:40,093 INFO L470 AbstractCegarLoop]: Abstraction has 1835 states and 2563 transitions. [2022-01-10 02:33:40,094 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:33:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2563 transitions. [2022-01-10 02:33:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:33:40,098 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:40,099 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:33:40,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 02:33:40,099 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:40,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1026148826, now seen corresponding path program 1 times [2022-01-10 02:33:40,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:40,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504809070] [2022-01-10 02:33:40,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:40,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:40,191 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:33:40,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:40,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504809070] [2022-01-10 02:33:40,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504809070] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:40,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:40,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:33:40,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116299127] [2022-01-10 02:33:40,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:40,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:33:40,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:40,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:33:40,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:33:40,193 INFO L87 Difference]: Start difference. First operand 1835 states and 2563 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:33:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:40,957 INFO L93 Difference]: Finished difference Result 2182 states and 3040 transitions. [2022-01-10 02:33:40,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:33:40,958 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:33:40,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:40,966 INFO L225 Difference]: With dead ends: 2182 [2022-01-10 02:33:40,967 INFO L226 Difference]: Without dead ends: 2005 [2022-01-10 02:33:40,967 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:33:40,970 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 706 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:40,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [726 Valid, 1088 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:33:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2022-01-10 02:33:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1931. [2022-01-10 02:33:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1536 states have (on average 1.384765625) internal successors, (2127), 1576 states have internal predecessors, (2127), 232 states have call successors, (232), 143 states have call predecessors, (232), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2022-01-10 02:33:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2697 transitions. [2022-01-10 02:33:41,083 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2697 transitions. Word has length 65 [2022-01-10 02:33:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:41,084 INFO L470 AbstractCegarLoop]: Abstraction has 1931 states and 2697 transitions. [2022-01-10 02:33:41,084 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:33:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2697 transitions. [2022-01-10 02:33:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:33:41,085 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:41,085 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:33:41,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 02:33:41,086 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:41,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:41,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1002437284, now seen corresponding path program 1 times [2022-01-10 02:33:41,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:41,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936239099] [2022-01-10 02:33:41,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:41,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,193 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:33:41,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:41,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936239099] [2022-01-10 02:33:41,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936239099] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:41,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:41,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:33:41,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266660423] [2022-01-10 02:33:41,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:41,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:33:41,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:41,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:33:41,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:33:41,195 INFO L87 Difference]: Start difference. First operand 1931 states and 2697 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:33:41,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:41,797 INFO L93 Difference]: Finished difference Result 2232 states and 3111 transitions. [2022-01-10 02:33:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:33:41,798 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:33:41,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:41,808 INFO L225 Difference]: With dead ends: 2232 [2022-01-10 02:33:41,808 INFO L226 Difference]: Without dead ends: 1965 [2022-01-10 02:33:41,809 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:33:41,809 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 212 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:41,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 1279 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:33:41,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2022-01-10 02:33:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1936. [2022-01-10 02:33:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1540 states have (on average 1.3824675324675324) internal successors, (2129), 1580 states have internal predecessors, (2129), 232 states have call successors, (232), 143 states have call predecessors, (232), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2022-01-10 02:33:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2700 transitions. [2022-01-10 02:33:41,936 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2700 transitions. Word has length 65 [2022-01-10 02:33:41,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:41,937 INFO L470 AbstractCegarLoop]: Abstraction has 1936 states and 2700 transitions. [2022-01-10 02:33:41,937 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:33:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2700 transitions. [2022-01-10 02:33:41,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:33:41,943 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:41,943 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:33:41,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 02:33:41,943 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:41,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:41,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2031796582, now seen corresponding path program 1 times [2022-01-10 02:33:41,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:41,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189802089] [2022-01-10 02:33:41,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:41,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:41,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:42,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:42,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:42,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:42,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:42,082 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:33:42,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:42,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189802089] [2022-01-10 02:33:42,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189802089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:42,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:42,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:33:42,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925020773] [2022-01-10 02:33:42,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:42,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:33:42,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:42,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:33:42,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:33:42,084 INFO L87 Difference]: Start difference. First operand 1936 states and 2700 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:33:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:43,599 INFO L93 Difference]: Finished difference Result 3598 states and 4972 transitions. [2022-01-10 02:33:43,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-10 02:33:43,599 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 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:33:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:43,614 INFO L225 Difference]: With dead ends: 3598 [2022-01-10 02:33:43,614 INFO L226 Difference]: Without dead ends: 3326 [2022-01-10 02:33:43,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-01-10 02:33:43,619 INFO L933 BasicCegarLoop]: 503 mSDtfsCounter, 1549 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:43,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1566 Valid, 1323 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 02:33:43,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2022-01-10 02:33:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3076. [2022-01-10 02:33:43,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3076 states, 2440 states have (on average 1.3565573770491803) internal successors, (3310), 2500 states have internal predecessors, (3310), 349 states have call successors, (349), 245 states have call predecessors, (349), 285 states have return successors, (525), 337 states have call predecessors, (525), 345 states have call successors, (525) [2022-01-10 02:33:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4184 transitions. [2022-01-10 02:33:43,837 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4184 transitions. Word has length 65 [2022-01-10 02:33:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:43,838 INFO L470 AbstractCegarLoop]: Abstraction has 3076 states and 4184 transitions. [2022-01-10 02:33:43,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:33:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4184 transitions. [2022-01-10 02:33:43,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:33:43,840 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:43,841 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:33:43,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 02:33:43,841 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:43,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:43,841 INFO L85 PathProgramCache]: Analyzing trace with hash -980347493, now seen corresponding path program 1 times [2022-01-10 02:33:43,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:43,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728748322] [2022-01-10 02:33:43,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:43,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:43,949 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:33:43,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:43,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728748322] [2022-01-10 02:33:43,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728748322] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:43,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:43,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:33:43,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784236395] [2022-01-10 02:33:43,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:43,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:33:43,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:43,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:33:43,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:33:43,951 INFO L87 Difference]: Start difference. First operand 3076 states and 4184 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:33:44,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:44,644 INFO L93 Difference]: Finished difference Result 4677 states and 6308 transitions. [2022-01-10 02:33:44,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:33:44,645 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:33:44,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:44,662 INFO L225 Difference]: With dead ends: 4677 [2022-01-10 02:33:44,662 INFO L226 Difference]: Without dead ends: 3265 [2022-01-10 02:33:44,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:33:44,668 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 210 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:44,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 1277 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:33:44,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3265 states. [2022-01-10 02:33:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3265 to 3121. [2022-01-10 02:33:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 2476 states have (on average 1.3477382875605817) internal successors, (3337), 2536 states have internal predecessors, (3337), 349 states have call successors, (349), 245 states have call predecessors, (349), 294 states have return successors, (537), 346 states have call predecessors, (537), 345 states have call successors, (537) [2022-01-10 02:33:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 4223 transitions. [2022-01-10 02:33:44,879 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 4223 transitions. Word has length 65 [2022-01-10 02:33:44,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:44,880 INFO L470 AbstractCegarLoop]: Abstraction has 3121 states and 4223 transitions. [2022-01-10 02:33:44,880 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:33:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 4223 transitions. [2022-01-10 02:33:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:33:44,882 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:44,882 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:33:44,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 02:33:44,883 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:44,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:44,883 INFO L85 PathProgramCache]: Analyzing trace with hash 405855901, now seen corresponding path program 1 times [2022-01-10 02:33:44,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:44,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083129152] [2022-01-10 02:33:44,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:44,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:44,961 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:33:44,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:44,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083129152] [2022-01-10 02:33:44,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083129152] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:44,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:44,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:33:44,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838273667] [2022-01-10 02:33:44,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:44,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:33:44,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:44,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:33:44,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:33:44,963 INFO L87 Difference]: Start difference. First operand 3121 states and 4223 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:33:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:45,697 INFO L93 Difference]: Finished difference Result 4556 states and 6062 transitions. [2022-01-10 02:33:45,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:33:45,698 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:33:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:45,713 INFO L225 Difference]: With dead ends: 4556 [2022-01-10 02:33:45,713 INFO L226 Difference]: Without dead ends: 3319 [2022-01-10 02:33:45,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-01-10 02:33:45,717 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 699 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:45,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [717 Valid, 863 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:33:45,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2022-01-10 02:33:45,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3099. [2022-01-10 02:33:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 2462 states have (on average 1.3456539398862712) internal successors, (3313), 2516 states have internal predecessors, (3313), 349 states have call successors, (349), 245 states have call predecessors, (349), 286 states have return successors, (521), 344 states have call predecessors, (521), 345 states have call successors, (521) [2022-01-10 02:33:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4183 transitions. [2022-01-10 02:33:45,897 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4183 transitions. Word has length 65 [2022-01-10 02:33:45,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:45,897 INFO L470 AbstractCegarLoop]: Abstraction has 3099 states and 4183 transitions. [2022-01-10 02:33:45,897 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:33:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4183 transitions. [2022-01-10 02:33:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:33:45,899 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:45,899 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:33:45,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 02:33:45,900 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:45,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:45,900 INFO L85 PathProgramCache]: Analyzing trace with hash 271842395, now seen corresponding path program 1 times [2022-01-10 02:33:45,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:45,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716814129] [2022-01-10 02:33:45,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:45,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:45,971 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:33:45,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:45,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716814129] [2022-01-10 02:33:45,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716814129] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:45,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:45,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:45,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666528374] [2022-01-10 02:33:45,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:45,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:45,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:45,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:45,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:45,973 INFO L87 Difference]: Start difference. First operand 3099 states and 4183 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:33:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:46,473 INFO L93 Difference]: Finished difference Result 6174 states and 8162 transitions. [2022-01-10 02:33:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:33:46,473 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:33:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:46,495 INFO L225 Difference]: With dead ends: 6174 [2022-01-10 02:33:46,495 INFO L226 Difference]: Without dead ends: 4742 [2022-01-10 02:33:46,501 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:33:46,502 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 810 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:46,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [834 Valid, 575 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:33:46,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4742 states. [2022-01-10 02:33:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4742 to 4470. [2022-01-10 02:33:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4470 states, 3528 states have (on average 1.312358276643991) internal successors, (4630), 3603 states have internal predecessors, (4630), 501 states have call successors, (501), 368 states have call predecessors, (501), 439 states have return successors, (793), 508 states have call predecessors, (793), 497 states have call successors, (793) [2022-01-10 02:33:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 5924 transitions. [2022-01-10 02:33:46,829 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 5924 transitions. Word has length 65 [2022-01-10 02:33:46,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:46,829 INFO L470 AbstractCegarLoop]: Abstraction has 4470 states and 5924 transitions. [2022-01-10 02:33:46,830 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:33:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 5924 transitions. [2022-01-10 02:33:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 02:33:46,832 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:46,832 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:33:46,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 02:33:46,833 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:46,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash 520491120, now seen corresponding path program 1 times [2022-01-10 02:33:46,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:46,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175238157] [2022-01-10 02:33:46,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:46,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:46,913 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:33:46,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:46,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175238157] [2022-01-10 02:33:46,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175238157] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:46,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:46,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:33:46,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682722890] [2022-01-10 02:33:46,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:46,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:33:46,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:46,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:33:46,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:33:46,915 INFO L87 Difference]: Start difference. First operand 4470 states and 5924 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:33:47,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:47,537 INFO L93 Difference]: Finished difference Result 9488 states and 12438 transitions. [2022-01-10 02:33:47,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:33:47,538 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:33:47,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:47,580 INFO L225 Difference]: With dead ends: 9488 [2022-01-10 02:33:47,581 INFO L226 Difference]: Without dead ends: 6664 [2022-01-10 02:33:47,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:33:47,590 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 381 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:47,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 817 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:33:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6664 states. [2022-01-10 02:33:47,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6664 to 6148. [2022-01-10 02:33:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6148 states, 4813 states have (on average 1.2944109702888011) internal successors, (6230), 4895 states have internal predecessors, (6230), 695 states have call successors, (695), 542 states have call predecessors, (695), 638 states have return successors, (1114), 720 states have call predecessors, (1114), 691 states have call successors, (1114) [2022-01-10 02:33:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 8039 transitions. [2022-01-10 02:33:47,936 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 8039 transitions. Word has length 66 [2022-01-10 02:33:47,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:47,937 INFO L470 AbstractCegarLoop]: Abstraction has 6148 states and 8039 transitions. [2022-01-10 02:33:47,937 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:33:47,937 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 8039 transitions. [2022-01-10 02:33:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 02:33:47,940 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:47,940 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:33:47,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 02:33:47,940 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:47,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:47,941 INFO L85 PathProgramCache]: Analyzing trace with hash 708381945, now seen corresponding path program 1 times [2022-01-10 02:33:47,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:47,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473890575] [2022-01-10 02:33:47,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:47,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:48,047 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:33:48,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:48,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473890575] [2022-01-10 02:33:48,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473890575] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:48,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:48,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:33:48,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240381637] [2022-01-10 02:33:48,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:48,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:33:48,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:48,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:33:48,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:33:48,049 INFO L87 Difference]: Start difference. First operand 6148 states and 8039 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:33:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:48,695 INFO L93 Difference]: Finished difference Result 7778 states and 10041 transitions. [2022-01-10 02:33:48,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:33:48,695 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:33:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:48,765 INFO L225 Difference]: With dead ends: 7778 [2022-01-10 02:33:48,765 INFO L226 Difference]: Without dead ends: 7775 [2022-01-10 02:33:48,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-01-10 02:33:48,768 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 946 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:48,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [955 Valid, 585 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:33:48,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7775 states. [2022-01-10 02:33:49,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7775 to 7202. [2022-01-10 02:33:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7202 states, 5616 states have (on average 1.2820512820512822) internal successors, (7200), 5707 states have internal predecessors, (7200), 821 states have call successors, (821), 656 states have call predecessors, (821), 763 states have return successors, (1307), 848 states have call predecessors, (1307), 818 states have call successors, (1307) [2022-01-10 02:33:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7202 states to 7202 states and 9328 transitions. [2022-01-10 02:33:49,217 INFO L78 Accepts]: Start accepts. Automaton has 7202 states and 9328 transitions. Word has length 73 [2022-01-10 02:33:49,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:49,217 INFO L470 AbstractCegarLoop]: Abstraction has 7202 states and 9328 transitions. [2022-01-10 02:33:49,217 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:33:49,217 INFO L276 IsEmpty]: Start isEmpty. Operand 7202 states and 9328 transitions. [2022-01-10 02:33:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-10 02:33:49,220 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:49,220 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:33:49,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 02:33:49,221 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:49,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:49,221 INFO L85 PathProgramCache]: Analyzing trace with hash 484349401, now seen corresponding path program 1 times [2022-01-10 02:33:49,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:49,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556405708] [2022-01-10 02:33:49,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:49,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:49,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:49,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:49,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:49,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:49,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:49,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:49,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:49,335 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:33:49,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:49,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556405708] [2022-01-10 02:33:49,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556405708] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:33:49,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938926747] [2022-01-10 02:33:49,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:49,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:33:49,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:33:49,356 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:33:49,358 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:33:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:49,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 02:33:49,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:33:49,939 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:33:49,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:33:50,178 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:33:50,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938926747] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:33:50,179 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 02:33:50,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-01-10 02:33:50,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739540322] [2022-01-10 02:33:50,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 02:33:50,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:33:50,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:50,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:33:50,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:33:50,181 INFO L87 Difference]: Start difference. First operand 7202 states and 9328 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:33:52,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:52,178 INFO L93 Difference]: Finished difference Result 14848 states and 18856 transitions. [2022-01-10 02:33:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-10 02:33:52,178 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:33:52,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:52,231 INFO L225 Difference]: With dead ends: 14848 [2022-01-10 02:33:52,231 INFO L226 Difference]: Without dead ends: 14845 [2022-01-10 02:33:52,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-01-10 02:33:52,243 INFO L933 BasicCegarLoop]: 450 mSDtfsCounter, 1129 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:52,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1187 Valid, 1616 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:33:52,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14845 states. [2022-01-10 02:33:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14845 to 12460. [2022-01-10 02:33:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12460 states, 9708 states have (on average 1.2679233621755253) internal successors, (12309), 9851 states have internal predecessors, (12309), 1387 states have call successors, (1387), 1146 states have call predecessors, (1387), 1363 states have return successors, (2246), 1472 states have call predecessors, (2246), 1384 states have call successors, (2246) [2022-01-10 02:33:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12460 states to 12460 states and 15942 transitions. [2022-01-10 02:33:53,193 INFO L78 Accepts]: Start accepts. Automaton has 12460 states and 15942 transitions. Word has length 74 [2022-01-10 02:33:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:53,193 INFO L470 AbstractCegarLoop]: Abstraction has 12460 states and 15942 transitions. [2022-01-10 02:33:53,194 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:33:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 12460 states and 15942 transitions. [2022-01-10 02:33:53,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-10 02:33:53,197 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:53,197 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:33:53,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 02:33:53,411 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,SelfDestructingSolverStorable14 [2022-01-10 02:33:53,411 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:53,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1609727865, now seen corresponding path program 2 times [2022-01-10 02:33:53,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:53,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735498469] [2022-01-10 02:33:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:53,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:53,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:53,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:53,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:53,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:53,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:53,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:53,469 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:33:53,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:53,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735498469] [2022-01-10 02:33:53,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735498469] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:53,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:53,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:33:53,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833764767] [2022-01-10 02:33:53,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:53,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:33:53,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:53,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:33:53,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:33:53,471 INFO L87 Difference]: Start difference. First operand 12460 states and 15942 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:33:54,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:54,393 INFO L93 Difference]: Finished difference Result 19003 states and 24284 transitions. [2022-01-10 02:33:54,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:33:54,394 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:33:54,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:54,425 INFO L225 Difference]: With dead ends: 19003 [2022-01-10 02:33:54,425 INFO L226 Difference]: Without dead ends: 9065 [2022-01-10 02:33:54,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:33:54,454 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 440 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:54,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [464 Valid, 823 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:33:54,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9065 states. [2022-01-10 02:33:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9065 to 8513. [2022-01-10 02:33:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8513 states, 6655 states have (on average 1.2545454545454546) internal successors, (8349), 6754 states have internal predecessors, (8349), 954 states have call successors, (954), 770 states have call predecessors, (954), 902 states have return successors, (1465), 998 states have call predecessors, (1465), 951 states have call successors, (1465) [2022-01-10 02:33:55,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8513 states to 8513 states and 10768 transitions. [2022-01-10 02:33:55,130 INFO L78 Accepts]: Start accepts. Automaton has 8513 states and 10768 transitions. Word has length 77 [2022-01-10 02:33:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:55,130 INFO L470 AbstractCegarLoop]: Abstraction has 8513 states and 10768 transitions. [2022-01-10 02:33:55,130 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:33:55,130 INFO L276 IsEmpty]: Start isEmpty. Operand 8513 states and 10768 transitions. [2022-01-10 02:33:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 02:33:55,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:55,135 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:33:55,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 02:33:55,135 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:55,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:55,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1048076277, now seen corresponding path program 1 times [2022-01-10 02:33:55,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:55,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381338589] [2022-01-10 02:33:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:55,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:55,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:55,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:33:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:55,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:33:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:55,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:33:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:55,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:33:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:33:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:55,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:33:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:55,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 02:33:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:55,219 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:33:55,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:55,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381338589] [2022-01-10 02:33:55,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381338589] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:55,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:33:55,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:33:55,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767818873] [2022-01-10 02:33:55,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:55,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:33:55,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:33:55,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:33:55,221 INFO L87 Difference]: Start difference. First operand 8513 states and 10768 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:33:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:56,731 INFO L93 Difference]: Finished difference Result 22387 states and 27985 transitions. [2022-01-10 02:33:56,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 02:33:56,732 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:33:56,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:56,792 INFO L225 Difference]: With dead ends: 22387 [2022-01-10 02:33:56,792 INFO L226 Difference]: Without dead ends: 15544 [2022-01-10 02:33:56,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-01-10 02:33:56,814 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 765 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:56,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [781 Valid, 962 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:33:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15544 states. [2022-01-10 02:33:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15544 to 14685. [2022-01-10 02:33:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14685 states, 11331 states have (on average 1.2210749271908923) internal successors, (13836), 11536 states have internal predecessors, (13836), 1670 states have call successors, (1670), 1374 states have call predecessors, (1670), 1682 states have return successors, (2868), 1790 states have call predecessors, (2868), 1667 states have call successors, (2868) [2022-01-10 02:33:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14685 states to 14685 states and 18374 transitions. [2022-01-10 02:33:57,604 INFO L78 Accepts]: Start accepts. Automaton has 14685 states and 18374 transitions. Word has length 84 [2022-01-10 02:33:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:57,604 INFO L470 AbstractCegarLoop]: Abstraction has 14685 states and 18374 transitions. [2022-01-10 02:33:57,604 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:33:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 14685 states and 18374 transitions. [2022-01-10 02:33:57,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-10 02:33:57,611 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:57,611 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 02:33:57,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 02:33:57,612 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:57,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:57,612 INFO L85 PathProgramCache]: Analyzing trace with hash -559065813, now seen corresponding path program 1 times [2022-01-10 02:33:57,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:57,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183500703] [2022-01-10 02:33:57,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:57,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:33:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:33:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:33:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:33:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-10 02:33:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:33:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:33:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-10 02:33:57,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:33:57,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183500703] [2022-01-10 02:33:57,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183500703] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:33:57,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605897789] [2022-01-10 02:33:57,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:57,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:33:57,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:33:57,689 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:33:57,690 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:33:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:57,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:33:57,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:33:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 02:33:57,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:33:57,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605897789] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:33:57,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:33:57,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 02:33:57,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536969139] [2022-01-10 02:33:57,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:33:57,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:33:57,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:33:57,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:33:57,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:33:57,883 INFO L87 Difference]: Start difference. First operand 14685 states and 18374 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 02:33:58,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:33:58,701 INFO L93 Difference]: Finished difference Result 17754 states and 22695 transitions. [2022-01-10 02:33:58,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:33:58,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2022-01-10 02:33:58,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:33:58,755 INFO L225 Difference]: With dead ends: 17754 [2022-01-10 02:33:58,755 INFO L226 Difference]: Without dead ends: 15078 [2022-01-10 02:33:58,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:33:58,771 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 114 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:33:58,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 676 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:33:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15078 states. [2022-01-10 02:33:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15078 to 15078. [2022-01-10 02:33:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15078 states, 11650 states have (on average 1.2243776824034336) internal successors, (14264), 11859 states have internal predecessors, (14264), 1712 states have call successors, (1712), 1402 states have call predecessors, (1712), 1714 states have return successors, (2932), 1832 states have call predecessors, (2932), 1709 states have call successors, (2932) [2022-01-10 02:33:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15078 states to 15078 states and 18908 transitions. [2022-01-10 02:33:59,738 INFO L78 Accepts]: Start accepts. Automaton has 15078 states and 18908 transitions. Word has length 93 [2022-01-10 02:33:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:33:59,738 INFO L470 AbstractCegarLoop]: Abstraction has 15078 states and 18908 transitions. [2022-01-10 02:33:59,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 02:33:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 15078 states and 18908 transitions. [2022-01-10 02:33:59,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-10 02:33:59,746 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:33:59,746 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:33:59,769 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:33:59,959 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,SelfDestructingSolverStorable17 [2022-01-10 02:33:59,959 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:33:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:33:59,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2008597495, now seen corresponding path program 1 times [2022-01-10 02:33:59,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:33:59,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19399782] [2022-01-10 02:33:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:33:59,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:33:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:33:59,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:33:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:00,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:00,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:00,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:00,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:00,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:00,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:00,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 02:34:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:00,037 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:34:00,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:00,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19399782] [2022-01-10 02:34:00,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19399782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:00,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:00,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:34:00,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996640983] [2022-01-10 02:34:00,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:00,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:34:00,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:00,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:34:00,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:34:00,040 INFO L87 Difference]: Start difference. First operand 15078 states and 18908 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:34:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:01,681 INFO L93 Difference]: Finished difference Result 25952 states and 32227 transitions. [2022-01-10 02:34:01,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 02:34:01,681 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:34:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:01,728 INFO L225 Difference]: With dead ends: 25952 [2022-01-10 02:34:01,728 INFO L226 Difference]: Without dead ends: 13553 [2022-01-10 02:34:01,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-01-10 02:34:01,754 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 1129 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:01,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1164 Valid, 1138 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:34:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13553 states. [2022-01-10 02:34:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13553 to 12653. [2022-01-10 02:34:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12653 states, 9816 states have (on average 1.2199470252648736) internal successors, (11975), 9992 states have internal predecessors, (11975), 1413 states have call successors, (1413), 1151 states have call predecessors, (1413), 1422 states have return successors, (2264), 1522 states have call predecessors, (2264), 1410 states have call successors, (2264) [2022-01-10 02:34:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12653 states to 12653 states and 15652 transitions. [2022-01-10 02:34:02,459 INFO L78 Accepts]: Start accepts. Automaton has 12653 states and 15652 transitions. Word has length 93 [2022-01-10 02:34:02,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:02,459 INFO L470 AbstractCegarLoop]: Abstraction has 12653 states and 15652 transitions. [2022-01-10 02:34:02,459 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:34:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 12653 states and 15652 transitions. [2022-01-10 02:34:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-01-10 02:34:02,470 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:02,470 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 02:34:02,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 02:34:02,470 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:02,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:02,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1056840823, now seen corresponding path program 1 times [2022-01-10 02:34:02,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:02,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690833092] [2022-01-10 02:34:02,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:02,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:02,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:02,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:34:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:02,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:34:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:02,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:34:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:02,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-10 02:34:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:02,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-01-10 02:34:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:02,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:02,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-01-10 02:34:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-01-10 02:34:02,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:02,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690833092] [2022-01-10 02:34:02,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690833092] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:02,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289064007] [2022-01-10 02:34:02,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:02,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:02,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:02,566 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:34:02,568 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:34:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:02,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:34:02,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 02:34:02,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:34:02,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289064007] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:02,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:34:02,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-01-10 02:34:02,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697750838] [2022-01-10 02:34:02,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:02,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:34:02,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:02,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:34:02,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:02,904 INFO L87 Difference]: Start difference. First operand 12653 states and 15652 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 02:34:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:03,453 INFO L93 Difference]: Finished difference Result 15507 states and 19695 transitions. [2022-01-10 02:34:03,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:34:03,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2022-01-10 02:34:03,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:03,547 INFO L225 Difference]: With dead ends: 15507 [2022-01-10 02:34:03,548 INFO L226 Difference]: Without dead ends: 13862 [2022-01-10 02:34:03,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:03,556 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 209 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:03,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 444 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:34:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13862 states. [2022-01-10 02:34:04,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13862 to 13818. [2022-01-10 02:34:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13818 states, 10756 states have (on average 1.2332651543324655) internal successors, (13265), 10949 states have internal predecessors, (13265), 1541 states have call successors, (1541), 1236 states have call predecessors, (1541), 1519 states have return successors, (2444), 1645 states have call predecessors, (2444), 1538 states have call successors, (2444) [2022-01-10 02:34:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13818 states to 13818 states and 17250 transitions. [2022-01-10 02:34:04,288 INFO L78 Accepts]: Start accepts. Automaton has 13818 states and 17250 transitions. Word has length 119 [2022-01-10 02:34:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:04,288 INFO L470 AbstractCegarLoop]: Abstraction has 13818 states and 17250 transitions. [2022-01-10 02:34:04,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-10 02:34:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 13818 states and 17250 transitions. [2022-01-10 02:34:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-01-10 02:34:04,302 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:04,303 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 02:34:04,327 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:34:04,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:04,524 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:04,525 INFO L85 PathProgramCache]: Analyzing trace with hash 131680678, now seen corresponding path program 1 times [2022-01-10 02:34:04,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:04,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772992527] [2022-01-10 02:34:04,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:04,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:04,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:04,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:34:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:04,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:34:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:04,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:04,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:34:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:04,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-10 02:34:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:04,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-10 02:34:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:04,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:04,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-10 02:34:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:04,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:04,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:34:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-01-10 02:34:04,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:04,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772992527] [2022-01-10 02:34:04,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772992527] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:04,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737510952] [2022-01-10 02:34:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:04,604 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:04,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:04,605 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:34:04,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 02:34:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:04,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:34:04,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-01-10 02:34:04,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:34:04,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737510952] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:04,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:34:04,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 02:34:04,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338797735] [2022-01-10 02:34:04,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:04,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:34:04,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:04,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:34:04,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:04,889 INFO L87 Difference]: Start difference. First operand 13818 states and 17250 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 02:34:05,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:05,555 INFO L93 Difference]: Finished difference Result 17504 states and 22428 transitions. [2022-01-10 02:34:05,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:34:05,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 135 [2022-01-10 02:34:05,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:05,583 INFO L225 Difference]: With dead ends: 17504 [2022-01-10 02:34:05,583 INFO L226 Difference]: Without dead ends: 14312 [2022-01-10 02:34:05,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:05,592 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 260 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:05,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 307 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:34:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14312 states. [2022-01-10 02:34:06,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14312 to 14202. [2022-01-10 02:34:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14202 states, 11115 states have (on average 1.2191632928475034) internal successors, (13551), 11303 states have internal predecessors, (13551), 1537 states have call successors, (1537), 1262 states have call predecessors, (1537), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2022-01-10 02:34:06,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14202 states to 14202 states and 17514 transitions. [2022-01-10 02:34:06,421 INFO L78 Accepts]: Start accepts. Automaton has 14202 states and 17514 transitions. Word has length 135 [2022-01-10 02:34:06,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:06,421 INFO L470 AbstractCegarLoop]: Abstraction has 14202 states and 17514 transitions. [2022-01-10 02:34:06,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 02:34:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 14202 states and 17514 transitions. [2022-01-10 02:34:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-01-10 02:34:06,434 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:06,434 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 02:34:06,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 02:34:06,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:06,658 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:06,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:06,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1548570021, now seen corresponding path program 1 times [2022-01-10 02:34:06,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:06,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024249249] [2022-01-10 02:34:06,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:06,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:06,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:06,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:34:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:06,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:34:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:06,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:06,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:34:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:06,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-10 02:34:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-01-10 02:34:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:06,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:06,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-10 02:34:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:06,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:06,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-01-10 02:34:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-01-10 02:34:06,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:06,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024249249] [2022-01-10 02:34:06,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024249249] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:06,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472817903] [2022-01-10 02:34:06,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:06,773 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:06,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:06,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:34:06,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 02:34:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:06,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:34:06,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-10 02:34:07,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:34:07,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472817903] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:07,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:34:07,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 02:34:07,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141257475] [2022-01-10 02:34:07,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:07,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:34:07,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:07,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:34:07,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:07,049 INFO L87 Difference]: Start difference. First operand 14202 states and 17514 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-10 02:34:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:07,633 INFO L93 Difference]: Finished difference Result 17861 states and 22355 transitions. [2022-01-10 02:34:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:34:07,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 135 [2022-01-10 02:34:07,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:07,668 INFO L225 Difference]: With dead ends: 17861 [2022-01-10 02:34:07,669 INFO L226 Difference]: Without dead ends: 14287 [2022-01-10 02:34:07,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:07,680 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 248 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:07,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 431 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:34:07,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14287 states. [2022-01-10 02:34:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14287 to 14172. [2022-01-10 02:34:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14172 states, 11085 states have (on average 1.211637347767253) internal successors, (13431), 11273 states have internal predecessors, (13431), 1537 states have call successors, (1537), 1262 states have call predecessors, (1537), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2022-01-10 02:34:08,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14172 states to 14172 states and 17394 transitions. [2022-01-10 02:34:08,529 INFO L78 Accepts]: Start accepts. Automaton has 14172 states and 17394 transitions. Word has length 135 [2022-01-10 02:34:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:08,529 INFO L470 AbstractCegarLoop]: Abstraction has 14172 states and 17394 transitions. [2022-01-10 02:34:08,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-10 02:34:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 14172 states and 17394 transitions. [2022-01-10 02:34:08,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-01-10 02:34:08,539 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:08,539 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:34:08,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 02:34:08,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-10 02:34:08,751 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:08,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:08,751 INFO L85 PathProgramCache]: Analyzing trace with hash 367339351, now seen corresponding path program 1 times [2022-01-10 02:34:08,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:08,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224364217] [2022-01-10 02:34:08,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:08,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:08,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:08,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:34:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:08,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:34:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:08,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:08,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:34:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:08,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-10 02:34:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:08,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 02:34:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:08,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:08,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:34:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:08,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:08,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-01-10 02:34:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-01-10 02:34:08,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:08,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224364217] [2022-01-10 02:34:08,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224364217] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:08,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118461562] [2022-01-10 02:34:08,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:08,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:08,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:08,844 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:34:08,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 02:34:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:08,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:34:08,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 02:34:09,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:34:09,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118461562] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:09,114 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:34:09,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-01-10 02:34:09,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243805743] [2022-01-10 02:34:09,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:09,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:34:09,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:09,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:34:09,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:09,116 INFO L87 Difference]: Start difference. First operand 14172 states and 17394 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 02:34:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:09,681 INFO L93 Difference]: Finished difference Result 15677 states and 19438 transitions. [2022-01-10 02:34:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:34:09,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136 [2022-01-10 02:34:09,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:09,719 INFO L225 Difference]: With dead ends: 15677 [2022-01-10 02:34:09,719 INFO L226 Difference]: Without dead ends: 13893 [2022-01-10 02:34:09,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:09,727 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 88 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:09,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 650 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:34:09,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13893 states. [2022-01-10 02:34:10,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13893 to 13829. [2022-01-10 02:34:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13829 states, 10810 states have (on average 1.2055504162812212) internal successors, (13032), 10994 states have internal predecessors, (13032), 1501 states have call successors, (1501), 1237 states have call predecessors, (1501), 1516 states have return successors, (2362), 1610 states have call predecessors, (2362), 1498 states have call successors, (2362) [2022-01-10 02:34:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13829 states to 13829 states and 16895 transitions. [2022-01-10 02:34:10,432 INFO L78 Accepts]: Start accepts. Automaton has 13829 states and 16895 transitions. Word has length 136 [2022-01-10 02:34:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:10,433 INFO L470 AbstractCegarLoop]: Abstraction has 13829 states and 16895 transitions. [2022-01-10 02:34:10,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-01-10 02:34:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 13829 states and 16895 transitions. [2022-01-10 02:34:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-10 02:34:10,442 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:10,443 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 02:34:10,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-10 02:34:10,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:10,660 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:10,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2008230337, now seen corresponding path program 1 times [2022-01-10 02:34:10,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:10,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508880663] [2022-01-10 02:34:10,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:10,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:34:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:34:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:34:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-10 02:34:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 02:34:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:34:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-01-10 02:34:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-01-10 02:34:10,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:10,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508880663] [2022-01-10 02:34:10,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508880663] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:10,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135233345] [2022-01-10 02:34:10,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:10,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:10,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:10,743 INFO L229 MonitoredProcess]: Starting monitored process 8 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:34:10,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 02:34:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 02:34:10,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-01-10 02:34:11,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:34:11,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135233345] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:11,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:34:11,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-01-10 02:34:11,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027796835] [2022-01-10 02:34:11,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:11,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:34:11,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:11,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:34:11,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:34:11,046 INFO L87 Difference]: Start difference. First operand 13829 states and 16895 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 02:34:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:11,961 INFO L93 Difference]: Finished difference Result 15723 states and 19305 transitions. [2022-01-10 02:34:11,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:34:11,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-01-10 02:34:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:11,994 INFO L225 Difference]: With dead ends: 15723 [2022-01-10 02:34:11,994 INFO L226 Difference]: Without dead ends: 12689 [2022-01-10 02:34:12,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:34:12,007 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 339 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:12,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 523 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:34:12,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12689 states. [2022-01-10 02:34:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12689 to 12501. [2022-01-10 02:34:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12501 states, 9730 states have (on average 1.18879753340185) internal successors, (11567), 9890 states have internal predecessors, (11567), 1361 states have call successors, (1361), 1140 states have call predecessors, (1361), 1408 states have return successors, (2139), 1481 states have call predecessors, (2139), 1358 states have call successors, (2139) [2022-01-10 02:34:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12501 states to 12501 states and 15067 transitions. [2022-01-10 02:34:12,770 INFO L78 Accepts]: Start accepts. Automaton has 12501 states and 15067 transitions. Word has length 137 [2022-01-10 02:34:12,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:12,770 INFO L470 AbstractCegarLoop]: Abstraction has 12501 states and 15067 transitions. [2022-01-10 02:34:12,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 02:34:12,770 INFO L276 IsEmpty]: Start isEmpty. Operand 12501 states and 15067 transitions. [2022-01-10 02:34:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-10 02:34:12,777 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:12,778 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 02:34:12,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 02:34:12,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:12,978 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:12,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:12,979 INFO L85 PathProgramCache]: Analyzing trace with hash 979594561, now seen corresponding path program 1 times [2022-01-10 02:34:12,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:12,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629433080] [2022-01-10 02:34:12,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:12,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:34:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:34:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:34:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-10 02:34:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 02:34:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:34:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-01-10 02:34:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-01-10 02:34:13,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:13,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629433080] [2022-01-10 02:34:13,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629433080] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:13,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662426861] [2022-01-10 02:34:13,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:13,083 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:13,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:13,088 INFO L229 MonitoredProcess]: Starting monitored process 9 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:34:13,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 02:34:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 02:34:13,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-10 02:34:13,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:34:13,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662426861] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:13,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:34:13,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-01-10 02:34:13,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495689600] [2022-01-10 02:34:13,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:13,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:34:13,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:13,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:34:13,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:13,388 INFO L87 Difference]: Start difference. First operand 12501 states and 15067 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 02:34:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:13,937 INFO L93 Difference]: Finished difference Result 14431 states and 17466 transitions. [2022-01-10 02:34:13,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:34:13,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-01-10 02:34:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:13,962 INFO L225 Difference]: With dead ends: 14431 [2022-01-10 02:34:13,963 INFO L226 Difference]: Without dead ends: 12557 [2022-01-10 02:34:13,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:34:13,971 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 10 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:13,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1103 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:34:13,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12557 states. [2022-01-10 02:34:14,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12557 to 12525. [2022-01-10 02:34:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12525 states, 9754 states have (on average 1.1847447201148247) internal successors, (11556), 9914 states have internal predecessors, (11556), 1361 states have call successors, (1361), 1140 states have call predecessors, (1361), 1408 states have return successors, (2139), 1481 states have call predecessors, (2139), 1358 states have call successors, (2139) [2022-01-10 02:34:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12525 states to 12525 states and 15056 transitions. [2022-01-10 02:34:14,734 INFO L78 Accepts]: Start accepts. Automaton has 12525 states and 15056 transitions. Word has length 137 [2022-01-10 02:34:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:14,734 INFO L470 AbstractCegarLoop]: Abstraction has 12525 states and 15056 transitions. [2022-01-10 02:34:14,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 02:34:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 12525 states and 15056 transitions. [2022-01-10 02:34:14,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-10 02:34:14,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:14,742 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 02:34:14,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-10 02:34:14,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-01-10 02:34:14,944 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1021717307, now seen corresponding path program 1 times [2022-01-10 02:34:14,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:14,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727082122] [2022-01-10 02:34:14,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:14,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:34:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:34:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:34:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-10 02:34:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 02:34:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:34:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-01-10 02:34:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,060 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-01-10 02:34:15,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:15,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727082122] [2022-01-10 02:34:15,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727082122] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:15,061 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:15,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:15,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878169684] [2022-01-10 02:34:15,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:15,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:15,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:15,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:15,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:15,063 INFO L87 Difference]: Start difference. First operand 12525 states and 15056 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 02:34:16,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:16,190 INFO L93 Difference]: Finished difference Result 13983 states and 16730 transitions. [2022-01-10 02:34:16,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 02:34:16,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2022-01-10 02:34:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:16,220 INFO L225 Difference]: With dead ends: 13983 [2022-01-10 02:34:16,220 INFO L226 Difference]: Without dead ends: 13980 [2022-01-10 02:34:16,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-01-10 02:34:16,225 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 718 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:16,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [751 Valid, 817 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:34:16,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13980 states. [2022-01-10 02:34:17,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13980 to 13496. [2022-01-10 02:34:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13496 states, 10552 states have (on average 1.182524639878696) internal successors, (12478), 10722 states have internal predecessors, (12478), 1454 states have call successors, (1454), 1207 states have call predecessors, (1454), 1488 states have return successors, (2252), 1577 states have call predecessors, (2252), 1451 states have call successors, (2252) [2022-01-10 02:34:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13496 states to 13496 states and 16184 transitions. [2022-01-10 02:34:17,066 INFO L78 Accepts]: Start accepts. Automaton has 13496 states and 16184 transitions. Word has length 137 [2022-01-10 02:34:17,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:17,066 INFO L470 AbstractCegarLoop]: Abstraction has 13496 states and 16184 transitions. [2022-01-10 02:34:17,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-01-10 02:34:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 13496 states and 16184 transitions. [2022-01-10 02:34:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:34:17,077 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:17,077 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:34:17,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 02:34:17,078 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:17,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1303301901, now seen corresponding path program 1 times [2022-01-10 02:34:17,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:17,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011747333] [2022-01-10 02:34:17,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:17,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 02:34:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 02:34:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-10 02:34:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:34:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-01-10 02:34:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-01-10 02:34:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,174 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:34:17,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:17,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011747333] [2022-01-10 02:34:17,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011747333] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:17,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108828252] [2022-01-10 02:34:17,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:17,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:17,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:17,180 INFO L229 MonitoredProcess]: Starting monitored process 10 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:34:17,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 02:34:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:34:17,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:17,437 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:34:17,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:34:17,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108828252] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:17,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 02:34:17,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-01-10 02:34:17,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142633797] [2022-01-10 02:34:17,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:17,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:17,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:17,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:17,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:34:17,439 INFO L87 Difference]: Start difference. First operand 13496 states and 16184 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:34:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:17,874 INFO L93 Difference]: Finished difference Result 18644 states and 22404 transitions. [2022-01-10 02:34:17,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:34:17,875 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:34:17,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:17,898 INFO L225 Difference]: With dead ends: 18644 [2022-01-10 02:34:17,898 INFO L226 Difference]: Without dead ends: 8062 [2022-01-10 02:34:17,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 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:34:17,915 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 34 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1358 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:34:17,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1358 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:34:17,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2022-01-10 02:34:18,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 7620. [2022-01-10 02:34:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7620 states, 6117 states have (on average 1.1678927578878535) internal successors, (7144), 6185 states have internal predecessors, (7144), 756 states have call successors, (756), 601 states have call predecessors, (756), 745 states have return successors, (1092), 835 states have call predecessors, (1092), 753 states have call successors, (1092) [2022-01-10 02:34:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7620 states to 7620 states and 8992 transitions. [2022-01-10 02:34:18,344 INFO L78 Accepts]: Start accepts. Automaton has 7620 states and 8992 transitions. Word has length 145 [2022-01-10 02:34:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:18,344 INFO L470 AbstractCegarLoop]: Abstraction has 7620 states and 8992 transitions. [2022-01-10 02:34:18,344 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:34:18,345 INFO L276 IsEmpty]: Start isEmpty. Operand 7620 states and 8992 transitions. [2022-01-10 02:34:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-01-10 02:34:18,350 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:18,350 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:34:18,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-10 02:34:18,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-10 02:34:18,551 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:18,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:18,551 INFO L85 PathProgramCache]: Analyzing trace with hash -72735443, now seen corresponding path program 1 times [2022-01-10 02:34:18,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:18,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815832979] [2022-01-10 02:34:18,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:18,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:34:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 02:34:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 02:34:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-10 02:34:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 02:34:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:34:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-10 02:34:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-01-10 02:34:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-01-10 02:34:18,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:18,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815832979] [2022-01-10 02:34:18,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815832979] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:18,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:18,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:34:18,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971175171] [2022-01-10 02:34:18,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:18,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:34:18,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:18,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:34:18,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:34:18,618 INFO L87 Difference]: Start difference. First operand 7620 states and 8992 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 02:34:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:19,366 INFO L93 Difference]: Finished difference Result 10269 states and 12313 transitions. [2022-01-10 02:34:19,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:34:19,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2022-01-10 02:34:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:19,381 INFO L225 Difference]: With dead ends: 10269 [2022-01-10 02:34:19,381 INFO L226 Difference]: Without dead ends: 8441 [2022-01-10 02:34:19,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:19,386 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 247 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:19,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 775 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:34:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8441 states. [2022-01-10 02:34:19,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8441 to 7623. [2022-01-10 02:34:19,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7623 states, 6120 states have (on average 1.16781045751634) internal successors, (7147), 6188 states have internal predecessors, (7147), 756 states have call successors, (756), 601 states have call predecessors, (756), 745 states have return successors, (1092), 835 states have call predecessors, (1092), 753 states have call successors, (1092) [2022-01-10 02:34:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7623 states to 7623 states and 8995 transitions. [2022-01-10 02:34:19,813 INFO L78 Accepts]: Start accepts. Automaton has 7623 states and 8995 transitions. Word has length 141 [2022-01-10 02:34:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:19,814 INFO L470 AbstractCegarLoop]: Abstraction has 7623 states and 8995 transitions. [2022-01-10 02:34:19,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-10 02:34:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 7623 states and 8995 transitions. [2022-01-10 02:34:19,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-01-10 02:34:19,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:19,819 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2022-01-10 02:34:19,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 02:34:19,819 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:19,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:19,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1025674187, now seen corresponding path program 1 times [2022-01-10 02:34:19,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:19,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684652667] [2022-01-10 02:34:19,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:19,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 02:34:19,831 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 02:34:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 02:34:19,891 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 02:34:19,891 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 02:34:19,892 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-10 02:34:19,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-10 02:34:19,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 02:34:19,896 INFO L732 BasicCegarLoop]: Path program 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] [2022-01-10 02:34:19,899 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 02:34:20,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:34:20 BoogieIcfgContainer [2022-01-10 02:34:20,022 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 02:34:20,022 INFO L158 Benchmark]: Toolchain (without parser) took 46924.72ms. Allocated memory was 181.4MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 125.2MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 774.9MB. Max. memory is 8.0GB. [2022-01-10 02:34:20,022 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 02:34:20,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.64ms. Allocated memory was 181.4MB in the beginning and 251.7MB in the end (delta: 70.3MB). Free memory was 125.0MB in the beginning and 218.3MB in the end (delta: -93.3MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-01-10 02:34:20,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.26ms. Allocated memory is still 251.7MB. Free memory was 218.3MB in the beginning and 215.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 02:34:20,023 INFO L158 Benchmark]: Boogie Preprocessor took 51.73ms. Allocated memory is still 251.7MB. Free memory was 215.6MB in the beginning and 213.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 02:34:20,025 INFO L158 Benchmark]: RCFGBuilder took 641.69ms. Allocated memory is still 251.7MB. Free memory was 213.0MB in the beginning and 188.9MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-01-10 02:34:20,025 INFO L158 Benchmark]: TraceAbstraction took 45764.73ms. Allocated memory was 251.7MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 188.4MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 768.1MB. Max. memory is 8.0GB. [2022-01-10 02:34:20,032 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 403.64ms. Allocated memory was 181.4MB in the beginning and 251.7MB in the end (delta: 70.3MB). Free memory was 125.0MB in the beginning and 218.3MB in the end (delta: -93.3MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.26ms. Allocated memory is still 251.7MB. Free memory was 218.3MB in the beginning and 215.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.73ms. Allocated memory is still 251.7MB. Free memory was 215.6MB in the beginning and 213.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 641.69ms. Allocated memory is still 251.7MB. Free memory was 213.0MB in the beginning and 188.9MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 45764.73ms. Allocated memory was 251.7MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 188.4MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 768.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L974] COND FALSE !(__VERIFIER_nondet_int()) [L977] CALL main2() [L961] int __retres1 ; [L965] CALL init_model2() [L876] m_i = 1 [L877] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L965] RET init_model2() [L966] CALL start_simulation2() [L902] int kernel_st ; [L903] int tmp ; [L904] int tmp___0 ; [L908] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L909] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] CALL init_threads2() [L658] COND TRUE m_i == 1 [L659] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L663] COND TRUE t1_i == 1 [L664] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] RET init_threads2() [L911] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L747] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L752] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L757] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L762] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L911] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L912] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L612] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L622] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L624] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L631] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L643] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L912] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L775] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L780] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L785] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L790] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L916] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L919] kernel_st = 1 [L920] CALL eval2() [L694] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L531] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L534] token = __VERIFIER_nondet_int() [L535] local = token [L536] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L537] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L829] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L612] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L624] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L631] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L632] COND TRUE E_1 == 1 [L633] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L643] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L829] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L537] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L538] E_1 = 2 [L539] m_pc = 1 [L540] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L714] RET master() [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L579] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L595] token += 1 [L596] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L829] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L612] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L613] COND TRUE E_M == 1 [L614] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L624] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L631] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L632] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L641] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L643] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L829] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L598] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L587] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L728] RET transmit1() [L698] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L701] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L673] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L689] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L701] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-2, token=1] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L523] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L545] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L550] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L551] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L556] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L557] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L558] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L559] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L496] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 216 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 45.6s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 24.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15065 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14690 mSDsluCounter, 25033 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15936 mSDsCounter, 3697 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13523 IncrementalHoareTripleChecker+Invalid, 17220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3697 mSolverCounterUnsat, 9097 mSDtfsCounter, 13523 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2126 GetRequests, 1756 SyntacticMatches, 5 SemanticMatches, 365 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15078occurred in iteration=18, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 9769 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 3780 NumberOfCodeBlocks, 3780 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3674 ConstructedInterpolants, 0 QuantifiedInterpolants, 7289 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3759 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 38 InterpolantComputations, 27 PerfectInterpolantSequences, 1262/1339 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 02:34:20,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...