/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_Bitvector.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 08:20:04,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 08:20:04,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 08:20:05,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 08:20:05,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 08:20:05,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 08:20:05,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 08:20:05,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 08:20:05,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 08:20:05,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 08:20:05,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 08:20:05,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 08:20:05,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 08:20:05,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 08:20:05,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 08:20:05,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 08:20:05,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 08:20:05,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 08:20:05,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 08:20:05,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 08:20:05,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 08:20:05,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 08:20:05,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 08:20:05,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 08:20:05,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 08:20:05,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 08:20:05,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 08:20:05,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 08:20:05,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 08:20:05,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 08:20:05,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 08:20:05,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 08:20:05,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 08:20:05,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 08:20:05,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 08:20:05,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 08:20:05,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 08:20:05,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 08:20:05,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 08:20:05,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 08:20:05,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 08:20:05,079 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 08:20:05,109 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 08:20:05,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 08:20:05,110 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 08:20:05,110 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 08:20:05,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 08:20:05,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 08:20:05,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 08:20:05,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 08:20:05,112 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 08:20:05,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 08:20:05,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 08:20:05,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 08:20:05,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 08:20:05,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 08:20:05,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 08:20:05,113 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 08:20:05,114 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 08:20:05,114 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 08:20:05,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 08:20:05,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 08:20:05,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 08:20:05,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 08:20:05,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 08:20:05,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 08:20:05,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 08:20:05,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 08:20:05,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 08:20:05,116 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 08:20:05,116 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 08:20:05,116 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 08:20:05,116 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 08:20:05,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 08:20:05,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 08:20:05,117 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 08:20:05,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 08:20:05,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 08:20:05,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 08:20:05,376 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 08:20:05,377 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 08:20:05,377 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 08:20:05,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/137805c7c/87a13dc8cd5e4ee2a250977e037d2806/FLAG93b282242 [2022-01-10 08:20:05,816 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 08:20:05,817 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 08:20:05,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/137805c7c/87a13dc8cd5e4ee2a250977e037d2806/FLAG93b282242 [2022-01-10 08:20:06,210 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/137805c7c/87a13dc8cd5e4ee2a250977e037d2806 [2022-01-10 08:20:06,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 08:20:06,213 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 08:20:06,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 08:20:06,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 08:20:06,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 08:20:06,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:20:06" (1/1) ... [2022-01-10 08:20:06,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aca38b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:20:06, skipping insertion in model container [2022-01-10 08:20:06,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:20:06" (1/1) ... [2022-01-10 08:20:06,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 08:20:06,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 08:20:06,405 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 08:20:06,445 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 08:20:06,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 08:20:06,479 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 08:20:06,489 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 08:20:06,505 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 08:20:06,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 08:20:06,551 INFO L208 MainTranslator]: Completed translation [2022-01-10 08:20:06,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:20:06 WrapperNode [2022-01-10 08:20:06,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 08:20:06,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 08:20:06,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 08:20:06,552 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 08:20:06,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:20:06" (1/1) ... [2022-01-10 08:20:06,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:20:06" (1/1) ... [2022-01-10 08:20:06,595 INFO L137 Inliner]: procedures = 56, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 389 [2022-01-10 08:20:06,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 08:20:06,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 08:20:06,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 08:20:06,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 08:20:06,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:20:06" (1/1) ... [2022-01-10 08:20:06,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:20:06" (1/1) ... [2022-01-10 08:20:06,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:20:06" (1/1) ... [2022-01-10 08:20:06,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:20:06" (1/1) ... [2022-01-10 08:20:06,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:20:06" (1/1) ... [2022-01-10 08:20:06,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:20:06" (1/1) ... [2022-01-10 08:20:06,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:20:06" (1/1) ... [2022-01-10 08:20:06,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 08:20:06,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 08:20:06,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 08:20:06,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 08:20:06,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:20:06" (1/1) ... [2022-01-10 08:20:06,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 08:20:06,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 08:20:06,668 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 08:20:06,670 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 08:20:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 08:20:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 08:20:06,697 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 08:20:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-01-10 08:20:06,697 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-01-10 08:20:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-01-10 08:20:06,697 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-01-10 08:20:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-01-10 08:20:06,697 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-01-10 08:20:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-01-10 08:20:06,697 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-01-10 08:20:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-01-10 08:20:06,698 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-01-10 08:20:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-01-10 08:20:06,698 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-01-10 08:20:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-01-10 08:20:06,698 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-01-10 08:20:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 08:20:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-01-10 08:20:06,698 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-01-10 08:20:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-01-10 08:20:06,698 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-01-10 08:20:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-01-10 08:20:06,699 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-01-10 08:20:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-01-10 08:20:06,699 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-01-10 08:20:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-01-10 08:20:06,699 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-01-10 08:20:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 08:20:06,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 08:20:06,699 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-01-10 08:20:06,699 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-01-10 08:20:06,700 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-01-10 08:20:06,700 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-01-10 08:20:06,777 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 08:20:06,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 08:20:07,128 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 08:20:07,136 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 08:20:07,137 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-10 08:20:07,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:20:07 BoogieIcfgContainer [2022-01-10 08:20:07,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 08:20:07,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 08:20:07,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 08:20:07,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 08:20:07,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:20:06" (1/3) ... [2022-01-10 08:20:07,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c4ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:20:07, skipping insertion in model container [2022-01-10 08:20:07,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:20:06" (2/3) ... [2022-01-10 08:20:07,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c4ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:20:07, skipping insertion in model container [2022-01-10 08:20:07,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:20:07" (3/3) ... [2022-01-10 08:20:07,146 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2022-01-10 08:20:07,150 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 08:20:07,150 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 08:20:07,191 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 08:20:07,202 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 08:20:07,203 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 08:20:07,236 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 08:20:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 08:20:07,249 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:07,250 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 08:20:07,251 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:07,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:07,256 INFO L85 PathProgramCache]: Analyzing trace with hash 243262796, now seen corresponding path program 1 times [2022-01-10 08:20:07,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:07,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628030540] [2022-01-10 08:20:07,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:07,270 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:07,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:07,279 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:07,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 08:20:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:07,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:20:07,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:07,658 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 08:20:07,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:07,659 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:07,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628030540] [2022-01-10 08:20:07,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628030540] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:07,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:07,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:20:07,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13081257] [2022-01-10 08:20:07,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:07,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:20:07,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:07,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:20:07,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:20:07,700 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 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:20:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:08,166 INFO L93 Difference]: Finished difference Result 518 states and 777 transitions. [2022-01-10 08:20:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:20:08,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-01-10 08:20:08,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:08,179 INFO L225 Difference]: With dead ends: 518 [2022-01-10 08:20:08,180 INFO L226 Difference]: Without dead ends: 309 [2022-01-10 08:20:08,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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 08:20:08,187 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 404 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:08,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 718 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 08:20:08,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-01-10 08:20:08,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 300. [2022-01-10 08:20:08,263 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, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-01-10 08:20:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 424 transitions. [2022-01-10 08:20:08,267 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 424 transitions. Word has length 58 [2022-01-10 08:20:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:08,267 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 424 transitions. [2022-01-10 08:20:08,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:20:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 424 transitions. [2022-01-10 08:20:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 08:20:08,270 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:08,270 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 08:20:08,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:08,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:08,480 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:08,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:08,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2037521992, now seen corresponding path program 1 times [2022-01-10 08:20:08,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:08,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758428137] [2022-01-10 08:20:08,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:08,482 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:08,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:08,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:08,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 08:20:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:08,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:20:08,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:08,709 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 08:20:08,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:08,714 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:08,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758428137] [2022-01-10 08:20:08,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758428137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:08,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:08,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:20:08,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155728086] [2022-01-10 08:20:08,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:08,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:20:08,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:08,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:20:08,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:20:08,722 INFO L87 Difference]: Start difference. First operand 300 states and 424 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:20:09,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:09,017 INFO L93 Difference]: Finished difference Result 495 states and 710 transitions. [2022-01-10 08:20:09,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 08:20:09,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-01-10 08:20:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:09,025 INFO L225 Difference]: With dead ends: 495 [2022-01-10 08:20:09,026 INFO L226 Difference]: Without dead ends: 300 [2022-01-10 08:20:09,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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 08:20:09,030 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 342 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:09,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 524 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 08:20:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-01-10 08:20:09,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2022-01-10 08:20:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 237 states have (on average 1.4261603375527425) internal successors, (338), 243 states have internal predecessors, (338), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (38), 37 states have call predecessors, (38), 37 states have call successors, (38) [2022-01-10 08:20:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 417 transitions. [2022-01-10 08:20:09,081 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 417 transitions. Word has length 58 [2022-01-10 08:20:09,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:09,082 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 417 transitions. [2022-01-10 08:20:09,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:20:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 417 transitions. [2022-01-10 08:20:09,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 08:20:09,090 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:09,090 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 08:20:09,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:09,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:09,299 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:09,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:09,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1363958966, now seen corresponding path program 1 times [2022-01-10 08:20:09,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:09,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048234274] [2022-01-10 08:20:09,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:09,301 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:09,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:09,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:09,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 08:20:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:09,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:20:09,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:09,466 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 08:20:09,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:09,467 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:09,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048234274] [2022-01-10 08:20:09,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048234274] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:09,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:09,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:20:09,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392055326] [2022-01-10 08:20:09,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:09,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:20:09,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:09,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:20:09,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:20:09,469 INFO L87 Difference]: Start difference. First operand 300 states and 417 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:20:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:09,749 INFO L93 Difference]: Finished difference Result 533 states and 752 transitions. [2022-01-10 08:20:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:20:09,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-01-10 08:20:09,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:09,752 INFO L225 Difference]: With dead ends: 533 [2022-01-10 08:20:09,752 INFO L226 Difference]: Without dead ends: 338 [2022-01-10 08:20:09,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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 08:20:09,754 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 352 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:09,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 516 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 08:20:09,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-01-10 08:20:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2022-01-10 08:20:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 269 states have (on average 1.3866171003717471) internal successors, (373), 275 states have internal predecessors, (373), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2022-01-10 08:20:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 456 transitions. [2022-01-10 08:20:09,776 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 456 transitions. Word has length 58 [2022-01-10 08:20:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:09,776 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 456 transitions. [2022-01-10 08:20:09,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:20:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 456 transitions. [2022-01-10 08:20:09,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 08:20:09,777 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:09,777 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 08:20:09,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:09,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:09,990 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:09,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:09,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1100475206, now seen corresponding path program 1 times [2022-01-10 08:20:09,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:09,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235633721] [2022-01-10 08:20:09,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:09,991 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:09,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:09,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:09,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 08:20:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:10,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:20:10,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:10,175 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 08:20:10,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:10,176 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:10,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235633721] [2022-01-10 08:20:10,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235633721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:10,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:10,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:20:10,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013245080] [2022-01-10 08:20:10,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:10,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:20:10,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:10,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:20:10,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:20:10,182 INFO L87 Difference]: Start difference. First operand 338 states and 456 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 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 08:20:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:10,238 INFO L93 Difference]: Finished difference Result 612 states and 833 transitions. [2022-01-10 08:20:10,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:20:10,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 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 08:20:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:10,242 INFO L225 Difference]: With dead ends: 612 [2022-01-10 08:20:10,242 INFO L226 Difference]: Without dead ends: 380 [2022-01-10 08:20:10,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:20:10,248 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 50 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1135 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 08:20:10,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 1135 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-01-10 08:20:10,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 344. [2022-01-10 08:20:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 275 states have (on average 1.3709090909090909) internal successors, (377), 281 states have internal predecessors, (377), 43 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2022-01-10 08:20:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 460 transitions. [2022-01-10 08:20:10,298 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 460 transitions. Word has length 58 [2022-01-10 08:20:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:10,300 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 460 transitions. [2022-01-10 08:20:10,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 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 08:20:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 460 transitions. [2022-01-10 08:20:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 08:20:10,302 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:10,302 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 08:20:10,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:10,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:10,512 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:10,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:10,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1143508092, now seen corresponding path program 1 times [2022-01-10 08:20:10,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:10,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168335376] [2022-01-10 08:20:10,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:10,513 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:10,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:10,514 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:10,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 08:20:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:10,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:20:10,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:10,692 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 08:20:10,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:10,693 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:10,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168335376] [2022-01-10 08:20:10,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168335376] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:10,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:10,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 08:20:10,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503269009] [2022-01-10 08:20:10,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:10,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:20:10,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:10,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:20:10,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:10,695 INFO L87 Difference]: Start difference. First operand 344 states and 460 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (6), 2 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 08:20:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:10,733 INFO L93 Difference]: Finished difference Result 763 states and 1020 transitions. [2022-01-10 08:20:10,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:20:10,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (6), 2 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 08:20:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:10,737 INFO L225 Difference]: With dead ends: 763 [2022-01-10 08:20:10,737 INFO L226 Difference]: Without dead ends: 525 [2022-01-10 08:20:10,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:10,739 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 242 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 447 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 08:20:10,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 447 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-01-10 08:20:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 517. [2022-01-10 08:20:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 416 states have (on average 1.3605769230769231) internal successors, (566), 423 states have internal predecessors, (566), 62 states have call successors, (62), 37 states have call predecessors, (62), 37 states have return successors, (60), 58 states have call predecessors, (60), 58 states have call successors, (60) [2022-01-10 08:20:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 688 transitions. [2022-01-10 08:20:10,773 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 688 transitions. Word has length 58 [2022-01-10 08:20:10,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:10,773 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 688 transitions. [2022-01-10 08:20:10,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (6), 2 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 08:20:10,773 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 688 transitions. [2022-01-10 08:20:10,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 08:20:10,774 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:10,774 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 08:20:10,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:10,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:10,984 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:10,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:10,984 INFO L85 PathProgramCache]: Analyzing trace with hash -224533469, now seen corresponding path program 1 times [2022-01-10 08:20:10,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:10,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815657866] [2022-01-10 08:20:10,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:10,985 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:10,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:10,986 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:10,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 08:20:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:11,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:20:11,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:11,134 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 08:20:11,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:11,135 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:11,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815657866] [2022-01-10 08:20:11,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815657866] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:11,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:11,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:20:11,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285792733] [2022-01-10 08:20:11,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:11,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:20:11,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:11,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:20:11,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:20:11,136 INFO L87 Difference]: Start difference. First operand 517 states and 688 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 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 08:20:11,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:11,188 INFO L93 Difference]: Finished difference Result 956 states and 1286 transitions. [2022-01-10 08:20:11,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:20:11,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 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 08:20:11,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:11,192 INFO L225 Difference]: With dead ends: 956 [2022-01-10 08:20:11,192 INFO L226 Difference]: Without dead ends: 545 [2022-01-10 08:20:11,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:20:11,194 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 10 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1139 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 08:20:11,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1139 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-01-10 08:20:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 529. [2022-01-10 08:20:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 428 states have (on average 1.3457943925233644) internal successors, (576), 435 states have internal predecessors, (576), 62 states have call successors, (62), 37 states have call predecessors, (62), 37 states have return successors, (60), 58 states have call predecessors, (60), 58 states have call successors, (60) [2022-01-10 08:20:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 698 transitions. [2022-01-10 08:20:11,228 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 698 transitions. Word has length 58 [2022-01-10 08:20:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:11,228 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 698 transitions. [2022-01-10 08:20:11,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 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 08:20:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 698 transitions. [2022-01-10 08:20:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 08:20:11,229 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:11,229 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 08:20:11,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:11,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:11,442 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:11,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:11,442 INFO L85 PathProgramCache]: Analyzing trace with hash -734006559, now seen corresponding path program 1 times [2022-01-10 08:20:11,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:11,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885201401] [2022-01-10 08:20:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:11,443 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:11,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:11,444 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:11,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 08:20:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:11,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 08:20:11,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:11,622 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 08:20:11,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:11,622 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:11,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885201401] [2022-01-10 08:20:11,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885201401] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:11,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:11,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:20:11,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533801624] [2022-01-10 08:20:11,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:11,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:20:11,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:11,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:20:11,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:20:11,624 INFO L87 Difference]: Start difference. First operand 529 states and 698 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:20:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:11,906 INFO L93 Difference]: Finished difference Result 1017 states and 1336 transitions. [2022-01-10 08:20:11,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:20:11,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-01-10 08:20:11,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:11,909 INFO L225 Difference]: With dead ends: 1017 [2022-01-10 08:20:11,909 INFO L226 Difference]: Without dead ends: 593 [2022-01-10 08:20:11,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:20:11,911 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 327 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:11,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 517 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 08:20:11,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-01-10 08:20:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 585. [2022-01-10 08:20:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 480 states have (on average 1.2833333333333334) internal successors, (616), 487 states have internal predecessors, (616), 62 states have call successors, (62), 41 states have call predecessors, (62), 41 states have return successors, (60), 58 states have call predecessors, (60), 58 states have call successors, (60) [2022-01-10 08:20:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 738 transitions. [2022-01-10 08:20:11,935 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 738 transitions. Word has length 58 [2022-01-10 08:20:11,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:11,935 INFO L470 AbstractCegarLoop]: Abstraction has 585 states and 738 transitions. [2022-01-10 08:20:11,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 08:20:11,936 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 738 transitions. [2022-01-10 08:20:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-10 08:20:11,937 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:11,937 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 08:20:11,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:12,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:12,145 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:12,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:12,146 INFO L85 PathProgramCache]: Analyzing trace with hash -311304733, now seen corresponding path program 1 times [2022-01-10 08:20:12,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:12,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495099910] [2022-01-10 08:20:12,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:12,147 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:12,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:12,148 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:12,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 08:20:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:12,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:20:12,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:20:12,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:12,328 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:12,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495099910] [2022-01-10 08:20:12,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495099910] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:12,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:12,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 08:20:12,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334608964] [2022-01-10 08:20:12,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:12,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:20:12,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:12,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:20:12,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:12,330 INFO L87 Difference]: Start difference. First operand 585 states and 738 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 08:20:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:12,369 INFO L93 Difference]: Finished difference Result 1490 states and 1854 transitions. [2022-01-10 08:20:12,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:20:12,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2022-01-10 08:20:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:12,374 INFO L225 Difference]: With dead ends: 1490 [2022-01-10 08:20:12,374 INFO L226 Difference]: Without dead ends: 1011 [2022-01-10 08:20:12,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:12,376 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 202 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 411 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 08:20:12,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 411 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-01-10 08:20:12,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1007. [2022-01-10 08:20:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 826 states have (on average 1.2324455205811138) internal successors, (1018), 839 states have internal predecessors, (1018), 104 states have call successors, (104), 73 states have call predecessors, (104), 75 states have return successors, (104), 96 states have call predecessors, (104), 100 states have call successors, (104) [2022-01-10 08:20:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1226 transitions. [2022-01-10 08:20:12,417 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1226 transitions. Word has length 58 [2022-01-10 08:20:12,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:12,417 INFO L470 AbstractCegarLoop]: Abstraction has 1007 states and 1226 transitions. [2022-01-10 08:20:12,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 08:20:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1226 transitions. [2022-01-10 08:20:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 08:20:12,418 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:12,419 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 08:20:12,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:12,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:12,628 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:12,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash -652739814, now seen corresponding path program 1 times [2022-01-10 08:20:12,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:12,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304822625] [2022-01-10 08:20:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:12,629 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:12,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:12,630 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:12,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 08:20:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:12,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 08:20:12,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:12,801 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 08:20:12,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:12,801 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:12,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304822625] [2022-01-10 08:20:12,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304822625] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:12,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:12,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:20:12,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239793950] [2022-01-10 08:20:12,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:12,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:20:12,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:12,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:20:12,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:20:12,803 INFO L87 Difference]: Start difference. First operand 1007 states and 1226 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:20:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:13,137 INFO L93 Difference]: Finished difference Result 1198 states and 1495 transitions. [2022-01-10 08:20:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:20:13,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-01-10 08:20:13,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:13,144 INFO L225 Difference]: With dead ends: 1198 [2022-01-10 08:20:13,144 INFO L226 Difference]: Without dead ends: 1110 [2022-01-10 08:20:13,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 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 08:20:13,145 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 247 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:13,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 748 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 08:20:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2022-01-10 08:20:13,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1103. [2022-01-10 08:20:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 902 states have (on average 1.2450110864745012) internal successors, (1123), 917 states have internal predecessors, (1123), 115 states have call successors, (115), 80 states have call predecessors, (115), 84 states have return successors, (120), 108 states have call predecessors, (120), 111 states have call successors, (120) [2022-01-10 08:20:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1358 transitions. [2022-01-10 08:20:13,188 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1358 transitions. Word has length 65 [2022-01-10 08:20:13,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:13,188 INFO L470 AbstractCegarLoop]: Abstraction has 1103 states and 1358 transitions. [2022-01-10 08:20:13,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:20:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1358 transitions. [2022-01-10 08:20:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 08:20:13,190 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:13,190 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 08:20:13,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:13,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:13,399 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:13,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:13,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1026148826, now seen corresponding path program 1 times [2022-01-10 08:20:13,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:13,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608975666] [2022-01-10 08:20:13,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:13,400 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:13,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:13,401 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:13,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 08:20:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:13,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 08:20:13,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:13,560 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 08:20:13,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:13,561 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:13,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608975666] [2022-01-10 08:20:13,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608975666] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:13,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:13,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 08:20:13,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126721162] [2022-01-10 08:20:13,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:13,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 08:20:13,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:13,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 08:20:13,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:20:13,563 INFO L87 Difference]: Start difference. First operand 1103 states and 1358 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:20:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:13,889 INFO L93 Difference]: Finished difference Result 1495 states and 1912 transitions. [2022-01-10 08:20:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:20:13,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-01-10 08:20:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:13,896 INFO L225 Difference]: With dead ends: 1495 [2022-01-10 08:20:13,896 INFO L226 Difference]: Without dead ends: 1316 [2022-01-10 08:20:13,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 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 08:20:13,897 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 239 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:13,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 753 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 08:20:13,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2022-01-10 08:20:13,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1308. [2022-01-10 08:20:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1063 states have (on average 1.2596425211665099) internal successors, (1339), 1086 states have internal predecessors, (1339), 137 states have call successors, (137), 94 states have call predecessors, (137), 106 states have return successors, (162), 132 states have call predecessors, (162), 133 states have call successors, (162) [2022-01-10 08:20:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1638 transitions. [2022-01-10 08:20:13,970 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1638 transitions. Word has length 65 [2022-01-10 08:20:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:13,971 INFO L470 AbstractCegarLoop]: Abstraction has 1308 states and 1638 transitions. [2022-01-10 08:20:13,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:20:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1638 transitions. [2022-01-10 08:20:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 08:20:13,973 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:13,973 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 08:20:13,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:14,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:14,182 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:14,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:14,182 INFO L85 PathProgramCache]: Analyzing trace with hash -85001701, now seen corresponding path program 1 times [2022-01-10 08:20:14,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:14,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430139774] [2022-01-10 08:20:14,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:14,183 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:14,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:14,184 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:14,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 08:20:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:14,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 08:20:14,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:14,339 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 08:20:14,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:14,340 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:14,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430139774] [2022-01-10 08:20:14,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430139774] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:14,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:14,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 08:20:14,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188357351] [2022-01-10 08:20:14,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:14,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 08:20:14,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:14,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 08:20:14,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 08:20:14,341 INFO L87 Difference]: Start difference. First operand 1308 states and 1638 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 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 08:20:14,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:14,397 INFO L93 Difference]: Finished difference Result 1698 states and 2170 transitions. [2022-01-10 08:20:14,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:20:14,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 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 08:20:14,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:14,405 INFO L225 Difference]: With dead ends: 1698 [2022-01-10 08:20:14,405 INFO L226 Difference]: Without dead ends: 1328 [2022-01-10 08:20:14,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:20:14,407 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 7 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:14,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 1379 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-01-10 08:20:14,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1318. [2022-01-10 08:20:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1071 states have (on average 1.2558356676003735) internal successors, (1345), 1094 states have internal predecessors, (1345), 137 states have call successors, (137), 94 states have call predecessors, (137), 108 states have return successors, (164), 134 states have call predecessors, (164), 133 states have call successors, (164) [2022-01-10 08:20:14,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1646 transitions. [2022-01-10 08:20:14,459 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1646 transitions. Word has length 65 [2022-01-10 08:20:14,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:14,459 INFO L470 AbstractCegarLoop]: Abstraction has 1318 states and 1646 transitions. [2022-01-10 08:20:14,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 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 08:20:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1646 transitions. [2022-01-10 08:20:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 08:20:14,461 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:14,461 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 08:20:14,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:14,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:14,670 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:14,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:14,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1114360999, now seen corresponding path program 1 times [2022-01-10 08:20:14,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:14,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341221990] [2022-01-10 08:20:14,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:14,671 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:14,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:14,672 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:14,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 08:20:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:14,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 08:20:14,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:14,834 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 08:20:14,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:14,834 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:14,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341221990] [2022-01-10 08:20:14,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341221990] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:14,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:14,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 08:20:14,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813788348] [2022-01-10 08:20:14,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:14,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 08:20:14,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:14,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 08:20:14,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 08:20:14,836 INFO L87 Difference]: Start difference. First operand 1318 states and 1646 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 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 08:20:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:14,892 INFO L93 Difference]: Finished difference Result 1712 states and 2176 transitions. [2022-01-10 08:20:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 08:20:14,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 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 08:20:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:14,913 INFO L225 Difference]: With dead ends: 1712 [2022-01-10 08:20:14,913 INFO L226 Difference]: Without dead ends: 1332 [2022-01-10 08:20:14,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:20:14,915 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 4 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:14,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 1380 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2022-01-10 08:20:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1328. [2022-01-10 08:20:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1079 states have (on average 1.252085264133457) internal successors, (1351), 1102 states have internal predecessors, (1351), 137 states have call successors, (137), 94 states have call predecessors, (137), 110 states have return successors, (166), 136 states have call predecessors, (166), 133 states have call successors, (166) [2022-01-10 08:20:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1654 transitions. [2022-01-10 08:20:14,976 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1654 transitions. Word has length 65 [2022-01-10 08:20:14,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:14,976 INFO L470 AbstractCegarLoop]: Abstraction has 1328 states and 1654 transitions. [2022-01-10 08:20:14,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 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 08:20:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1654 transitions. [2022-01-10 08:20:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 08:20:14,979 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:14,980 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 08:20:14,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:15,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:15,188 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:15,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:15,189 INFO L85 PathProgramCache]: Analyzing trace with hash 271842395, now seen corresponding path program 1 times [2022-01-10 08:20:15,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:15,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977495622] [2022-01-10 08:20:15,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:15,189 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:15,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:15,191 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:15,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 08:20:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:15,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:20:15,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:15,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 08:20:15,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:15,369 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:15,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977495622] [2022-01-10 08:20:15,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977495622] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:15,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:15,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:20:15,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784614513] [2022-01-10 08:20:15,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:15,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:20:15,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:15,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:20:15,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:20:15,371 INFO L87 Difference]: Start difference. First operand 1328 states and 1654 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 4 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 08:20:15,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:15,599 INFO L93 Difference]: Finished difference Result 2100 states and 2675 transitions. [2022-01-10 08:20:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:20:15,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 4 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 08:20:15,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:15,606 INFO L225 Difference]: With dead ends: 2100 [2022-01-10 08:20:15,606 INFO L226 Difference]: Without dead ends: 1714 [2022-01-10 08:20:15,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:20:15,609 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 345 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:15,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 455 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 08:20:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-01-10 08:20:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1710. [2022-01-10 08:20:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1371 states have (on average 1.2567469000729394) internal successors, (1723), 1409 states have internal predecessors, (1723), 183 states have call successors, (183), 122 states have call predecessors, (183), 154 states have return successors, (251), 187 states have call predecessors, (251), 179 states have call successors, (251) [2022-01-10 08:20:15,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2157 transitions. [2022-01-10 08:20:15,679 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2157 transitions. Word has length 65 [2022-01-10 08:20:15,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:15,680 INFO L470 AbstractCegarLoop]: Abstraction has 1710 states and 2157 transitions. [2022-01-10 08:20:15,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 4 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 08:20:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2157 transitions. [2022-01-10 08:20:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 08:20:15,683 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:15,683 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 08:20:15,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:15,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:15,891 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:15,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:15,891 INFO L85 PathProgramCache]: Analyzing trace with hash 520491120, now seen corresponding path program 1 times [2022-01-10 08:20:15,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:15,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38453325] [2022-01-10 08:20:15,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:15,892 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:15,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:15,893 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:15,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 08:20:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:15,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:20:15,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:16,086 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 08:20:16,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:16,087 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:16,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38453325] [2022-01-10 08:20:16,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38453325] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:16,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:16,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:20:16,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546892079] [2022-01-10 08:20:16,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:16,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:20:16,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:16,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:20:16,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:16,088 INFO L87 Difference]: Start difference. First operand 1710 states and 2157 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 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 08:20:16,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:16,177 INFO L93 Difference]: Finished difference Result 3126 states and 4004 transitions. [2022-01-10 08:20:16,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:20:16,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 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 66 [2022-01-10 08:20:16,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:16,187 INFO L225 Difference]: With dead ends: 3126 [2022-01-10 08:20:16,187 INFO L226 Difference]: Without dead ends: 2342 [2022-01-10 08:20:16,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:16,191 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 66 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:16,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 532 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2022-01-10 08:20:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2314. [2022-01-10 08:20:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 1845 states have (on average 1.2585365853658537) internal successors, (2322), 1892 states have internal predecessors, (2322), 237 states have call successors, (237), 178 states have call predecessors, (237), 230 states have return successors, (331), 248 states have call predecessors, (331), 233 states have call successors, (331) [2022-01-10 08:20:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 2890 transitions. [2022-01-10 08:20:16,290 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 2890 transitions. Word has length 66 [2022-01-10 08:20:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:16,291 INFO L470 AbstractCegarLoop]: Abstraction has 2314 states and 2890 transitions. [2022-01-10 08:20:16,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 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 08:20:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 2890 transitions. [2022-01-10 08:20:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 08:20:16,292 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:16,292 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 08:20:16,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:16,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:16,501 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:16,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1978730779, now seen corresponding path program 1 times [2022-01-10 08:20:16,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:16,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799239274] [2022-01-10 08:20:16,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:16,502 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:16,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:16,503 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:16,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 08:20:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:16,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:20:16,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:20:16,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:16,677 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:16,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799239274] [2022-01-10 08:20:16,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799239274] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:16,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:16,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:20:16,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292870960] [2022-01-10 08:20:16,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:16,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:20:16,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:16,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:20:16,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:16,679 INFO L87 Difference]: Start difference. First operand 2314 states and 2890 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 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 08:20:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:16,803 INFO L93 Difference]: Finished difference Result 4978 states and 6317 transitions. [2022-01-10 08:20:16,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:20:16,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 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 66 [2022-01-10 08:20:16,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:16,821 INFO L225 Difference]: With dead ends: 4978 [2022-01-10 08:20:16,822 INFO L226 Difference]: Without dead ends: 3598 [2022-01-10 08:20:16,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:16,828 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 211 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:16,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 397 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2022-01-10 08:20:16,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 3538. [2022-01-10 08:20:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3538 states, 2783 states have (on average 1.2504491555874955) internal successors, (3480), 2864 states have internal predecessors, (3480), 369 states have call successors, (369), 290 states have call predecessors, (369), 384 states have return successors, (543), 388 states have call predecessors, (543), 365 states have call successors, (543) [2022-01-10 08:20:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3538 states to 3538 states and 4392 transitions. [2022-01-10 08:20:17,007 INFO L78 Accepts]: Start accepts. Automaton has 3538 states and 4392 transitions. Word has length 66 [2022-01-10 08:20:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:17,008 INFO L470 AbstractCegarLoop]: Abstraction has 3538 states and 4392 transitions. [2022-01-10 08:20:17,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 2 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 08:20:17,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3538 states and 4392 transitions. [2022-01-10 08:20:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 08:20:17,010 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:17,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 08:20:17,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:17,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:17,219 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:17,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:17,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1207424945, now seen corresponding path program 1 times [2022-01-10 08:20:17,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:17,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991939533] [2022-01-10 08:20:17,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:17,220 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:17,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:17,221 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:17,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 08:20:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:17,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:20:17,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:17,395 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 08:20:17,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:17,396 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:17,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991939533] [2022-01-10 08:20:17,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991939533] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:17,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:17,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:20:17,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693256909] [2022-01-10 08:20:17,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:17,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:20:17,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:17,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:20:17,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:17,397 INFO L87 Difference]: Start difference. First operand 3538 states and 4392 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (8), 2 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 08:20:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:17,550 INFO L93 Difference]: Finished difference Result 6750 states and 8406 transitions. [2022-01-10 08:20:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:20:17,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (8), 2 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 72 [2022-01-10 08:20:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:17,565 INFO L225 Difference]: With dead ends: 6750 [2022-01-10 08:20:17,565 INFO L226 Difference]: Without dead ends: 4146 [2022-01-10 08:20:17,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:17,571 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 207 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:17,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:17,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4146 states. [2022-01-10 08:20:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4146 to 4102. [2022-01-10 08:20:17,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4102 states, 3219 states have (on average 1.2426219322771046) internal successors, (4000), 3308 states have internal predecessors, (4000), 433 states have call successors, (433), 346 states have call predecessors, (433), 448 states have return successors, (626), 452 states have call predecessors, (626), 429 states have call successors, (626) [2022-01-10 08:20:17,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5059 transitions. [2022-01-10 08:20:17,756 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5059 transitions. Word has length 72 [2022-01-10 08:20:17,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:17,756 INFO L470 AbstractCegarLoop]: Abstraction has 4102 states and 5059 transitions. [2022-01-10 08:20:17,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (8), 2 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 08:20:17,757 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5059 transitions. [2022-01-10 08:20:17,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 08:20:17,759 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:17,759 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 08:20:17,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:17,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:17,968 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:17,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:17,969 INFO L85 PathProgramCache]: Analyzing trace with hash 708381945, now seen corresponding path program 1 times [2022-01-10 08:20:17,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:17,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991317983] [2022-01-10 08:20:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:17,969 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:17,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:17,970 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:17,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-01-10 08:20:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:18,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:20:18,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:18,150 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 08:20:18,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:18,151 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:18,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991317983] [2022-01-10 08:20:18,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991317983] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:18,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:18,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:20:18,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702506344] [2022-01-10 08:20:18,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:18,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:20:18,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:18,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:20:18,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:20:18,152 INFO L87 Difference]: Start difference. First operand 4102 states and 5059 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 2 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 08:20:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:18,387 INFO L93 Difference]: Finished difference Result 4782 states and 5892 transitions. [2022-01-10 08:20:18,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 08:20:18,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 2 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 08:20:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:18,405 INFO L225 Difference]: With dead ends: 4782 [2022-01-10 08:20:18,406 INFO L226 Difference]: Without dead ends: 4779 [2022-01-10 08:20:18,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:20:18,408 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 501 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:18,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 390 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:20:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4779 states. [2022-01-10 08:20:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4779 to 4737. [2022-01-10 08:20:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4737 states, 3709 states have (on average 1.2404960905904556) internal successors, (4601), 3812 states have internal predecessors, (4601), 498 states have call successors, (498), 402 states have call predecessors, (498), 528 states have return successors, (729), 527 states have call predecessors, (729), 495 states have call successors, (729) [2022-01-10 08:20:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4737 states to 4737 states and 5828 transitions. [2022-01-10 08:20:18,619 INFO L78 Accepts]: Start accepts. Automaton has 4737 states and 5828 transitions. Word has length 73 [2022-01-10 08:20:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:18,620 INFO L470 AbstractCegarLoop]: Abstraction has 4737 states and 5828 transitions. [2022-01-10 08:20:18,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 2 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 08:20:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4737 states and 5828 transitions. [2022-01-10 08:20:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-10 08:20:18,621 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:18,621 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 08:20:18,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:18,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:18,830 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:18,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:18,831 INFO L85 PathProgramCache]: Analyzing trace with hash 484349401, now seen corresponding path program 1 times [2022-01-10 08:20:18,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:18,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794525776] [2022-01-10 08:20:18,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:18,831 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:18,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:18,833 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:18,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-01-10 08:20:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:18,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 08:20:18,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:19,281 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 08:20:19,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 08:20:19,432 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 08:20:19,433 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:19,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794525776] [2022-01-10 08:20:19,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794525776] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 08:20:19,433 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 08:20:19,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2022-01-10 08:20:19,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515093582] [2022-01-10 08:20:19,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 08:20:19,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 08:20:19,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:19,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 08:20:19,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:20:19,434 INFO L87 Difference]: Start difference. First operand 4737 states and 5828 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-10 08:20:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:20,109 INFO L93 Difference]: Finished difference Result 9720 states and 12028 transitions. [2022-01-10 08:20:20,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 08:20:20,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 74 [2022-01-10 08:20:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:20,158 INFO L225 Difference]: With dead ends: 9720 [2022-01-10 08:20:20,158 INFO L226 Difference]: Without dead ends: 9717 [2022-01-10 08:20:20,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 08:20:20,162 INFO L933 BasicCegarLoop]: 493 mSDtfsCounter, 611 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:20,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 1819 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 08:20:20,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9717 states. [2022-01-10 08:20:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9717 to 7319. [2022-01-10 08:20:20,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7319 states, 5711 states have (on average 1.2447907546839432) internal successors, (7109), 5880 states have internal predecessors, (7109), 762 states have call successors, (762), 626 states have call predecessors, (762), 844 states have return successors, (1163), 817 states have call predecessors, (1163), 759 states have call successors, (1163) [2022-01-10 08:20:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7319 states to 7319 states and 9034 transitions. [2022-01-10 08:20:20,591 INFO L78 Accepts]: Start accepts. Automaton has 7319 states and 9034 transitions. Word has length 74 [2022-01-10 08:20:20,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:20,591 INFO L470 AbstractCegarLoop]: Abstraction has 7319 states and 9034 transitions. [2022-01-10 08:20:20,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-10 08:20:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 7319 states and 9034 transitions. [2022-01-10 08:20:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-10 08:20:20,594 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:20,594 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 08:20:20,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:20,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:20,803 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:20,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1609727865, now seen corresponding path program 2 times [2022-01-10 08:20:20,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:20,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372021342] [2022-01-10 08:20:20,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 08:20:20,804 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:20,805 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:20,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-01-10 08:20:20,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 08:20:20,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 08:20:20,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:20:20,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:20,965 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 08:20:20,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:20,966 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:20,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372021342] [2022-01-10 08:20:20,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372021342] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:20,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:20,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:20:20,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708703784] [2022-01-10 08:20:20,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:20,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:20:20,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:20,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:20:20,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:20,967 INFO L87 Difference]: Start difference. First operand 7319 states and 9034 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 2 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 08:20:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:21,230 INFO L93 Difference]: Finished difference Result 10566 states and 13166 transitions. [2022-01-10 08:20:21,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:20:21,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 2 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 08:20:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:21,244 INFO L225 Difference]: With dead ends: 10566 [2022-01-10 08:20:21,245 INFO L226 Difference]: Without dead ends: 4755 [2022-01-10 08:20:21,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:21,259 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 247 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:21,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 470 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2022-01-10 08:20:21,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 4723. [2022-01-10 08:20:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4723 states, 3699 states have (on average 1.2281697756150312) internal successors, (4543), 3798 states have internal predecessors, (4543), 498 states have call successors, (498), 402 states have call predecessors, (498), 524 states have return successors, (697), 527 states have call predecessors, (697), 495 states have call successors, (697) [2022-01-10 08:20:21,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 5738 transitions. [2022-01-10 08:20:21,521 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 5738 transitions. Word has length 77 [2022-01-10 08:20:21,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:21,521 INFO L470 AbstractCegarLoop]: Abstraction has 4723 states and 5738 transitions. [2022-01-10 08:20:21,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 2 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 08:20:21,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 5738 transitions. [2022-01-10 08:20:21,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 08:20:21,524 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:21,525 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 08:20:21,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:21,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:21,734 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:21,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:21,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1048076277, now seen corresponding path program 1 times [2022-01-10 08:20:21,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:21,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926929190] [2022-01-10 08:20:21,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:21,734 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:21,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:21,736 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:21,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-01-10 08:20:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:21,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:20:21,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 08:20:21,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:21,903 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:21,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926929190] [2022-01-10 08:20:21,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926929190] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:21,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:21,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:20:21,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456840307] [2022-01-10 08:20:21,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:21,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:20:21,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:21,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:20:21,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:21,904 INFO L87 Difference]: Start difference. First operand 4723 states and 5738 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 08:20:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:22,259 INFO L93 Difference]: Finished difference Result 11746 states and 14283 transitions. [2022-01-10 08:20:22,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:20:22,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 84 [2022-01-10 08:20:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:22,280 INFO L225 Difference]: With dead ends: 11746 [2022-01-10 08:20:22,280 INFO L226 Difference]: Without dead ends: 6523 [2022-01-10 08:20:22,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:22,295 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 89 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 633 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 08:20:22,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 633 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:22,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6523 states. [2022-01-10 08:20:22,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6523 to 6523. [2022-01-10 08:20:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6523 states, 5061 states have (on average 1.217941118356056) internal successors, (6164), 5205 states have internal predecessors, (6164), 696 states have call successors, (696), 570 states have call predecessors, (696), 764 states have return successors, (1021), 752 states have call predecessors, (1021), 693 states have call successors, (1021) [2022-01-10 08:20:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 7881 transitions. [2022-01-10 08:20:22,680 INFO L78 Accepts]: Start accepts. Automaton has 6523 states and 7881 transitions. Word has length 84 [2022-01-10 08:20:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:22,681 INFO L470 AbstractCegarLoop]: Abstraction has 6523 states and 7881 transitions. [2022-01-10 08:20:22,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 08:20:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 6523 states and 7881 transitions. [2022-01-10 08:20:22,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-10 08:20:22,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:22,684 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-01-10 08:20:22,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:22,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:22,893 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:22,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:22,894 INFO L85 PathProgramCache]: Analyzing trace with hash 171951439, now seen corresponding path program 1 times [2022-01-10 08:20:22,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:22,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587016754] [2022-01-10 08:20:22,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:22,894 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:22,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:22,896 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:22,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-01-10 08:20:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:22,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:20:22,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 08:20:23,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:23,118 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:23,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587016754] [2022-01-10 08:20:23,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587016754] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:23,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:23,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:20:23,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348914584] [2022-01-10 08:20:23,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:23,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:20:23,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:23,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:20:23,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:20:23,119 INFO L87 Difference]: Start difference. First operand 6523 states and 7881 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 08:20:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:23,600 INFO L93 Difference]: Finished difference Result 12138 states and 14681 transitions. [2022-01-10 08:20:23,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:20:23,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2022-01-10 08:20:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:23,618 INFO L225 Difference]: With dead ends: 12138 [2022-01-10 08:20:23,619 INFO L226 Difference]: Without dead ends: 6553 [2022-01-10 08:20:23,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:20:23,632 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 325 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:23,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 436 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:20:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6553 states. [2022-01-10 08:20:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6553 to 6553. [2022-01-10 08:20:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6553 states, 5076 states have (on average 1.204294720252167) internal successors, (6113), 5235 states have internal predecessors, (6113), 696 states have call successors, (696), 570 states have call predecessors, (696), 779 states have return successors, (1021), 752 states have call predecessors, (1021), 693 states have call successors, (1021) [2022-01-10 08:20:23,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 7830 transitions. [2022-01-10 08:20:23,961 INFO L78 Accepts]: Start accepts. Automaton has 6553 states and 7830 transitions. Word has length 92 [2022-01-10 08:20:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:23,961 INFO L470 AbstractCegarLoop]: Abstraction has 6553 states and 7830 transitions. [2022-01-10 08:20:23,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 08:20:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 6553 states and 7830 transitions. [2022-01-10 08:20:23,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-10 08:20:23,965 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:23,965 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 08:20:23,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:24,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:24,174 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:24,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:24,174 INFO L85 PathProgramCache]: Analyzing trace with hash 191116075, now seen corresponding path program 1 times [2022-01-10 08:20:24,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:24,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193897366] [2022-01-10 08:20:24,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:24,175 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:24,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:24,176 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:24,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-01-10 08:20:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:24,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 08:20:24,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:24,405 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 08:20:24,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:24,405 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:24,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193897366] [2022-01-10 08:20:24,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193897366] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:24,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:24,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:20:24,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359689683] [2022-01-10 08:20:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:24,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:20:24,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:24,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:20:24,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:20:24,406 INFO L87 Difference]: Start difference. First operand 6553 states and 7830 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 08:20:24,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:24,879 INFO L93 Difference]: Finished difference Result 8249 states and 9905 transitions. [2022-01-10 08:20:24,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:20:24,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93 [2022-01-10 08:20:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:24,896 INFO L225 Difference]: With dead ends: 8249 [2022-01-10 08:20:24,896 INFO L226 Difference]: Without dead ends: 7349 [2022-01-10 08:20:24,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:20:24,901 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 299 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:24,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 562 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:20:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7349 states. [2022-01-10 08:20:25,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7349 to 7345. [2022-01-10 08:20:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7345 states, 5721 states have (on average 1.2015381926236672) internal successors, (6874), 5893 states have internal predecessors, (6874), 775 states have call successors, (775), 626 states have call predecessors, (775), 847 states have return successors, (1136), 831 states have call predecessors, (1136), 772 states have call successors, (1136) [2022-01-10 08:20:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7345 states to 7345 states and 8785 transitions. [2022-01-10 08:20:25,226 INFO L78 Accepts]: Start accepts. Automaton has 7345 states and 8785 transitions. Word has length 93 [2022-01-10 08:20:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:25,227 INFO L470 AbstractCegarLoop]: Abstraction has 7345 states and 8785 transitions. [2022-01-10 08:20:25,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 08:20:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 7345 states and 8785 transitions. [2022-01-10 08:20:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-10 08:20:25,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:25,231 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 08:20:25,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:25,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:25,440 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:25,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:25,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1688014871, now seen corresponding path program 1 times [2022-01-10 08:20:25,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:25,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813401376] [2022-01-10 08:20:25,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:25,441 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:25,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:25,442 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:25,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-01-10 08:20:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:25,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:20:25,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-10 08:20:25,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:25,628 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:25,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813401376] [2022-01-10 08:20:25,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813401376] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:25,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:25,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:20:25,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084183244] [2022-01-10 08:20:25,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:25,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:20:25,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:25,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:20:25,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:25,629 INFO L87 Difference]: Start difference. First operand 7345 states and 8785 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:20:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:25,995 INFO L93 Difference]: Finished difference Result 8657 states and 10354 transitions. [2022-01-10 08:20:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:20:25,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93 [2022-01-10 08:20:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:26,021 INFO L225 Difference]: With dead ends: 8657 [2022-01-10 08:20:26,021 INFO L226 Difference]: Without dead ends: 6965 [2022-01-10 08:20:26,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:26,030 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 138 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:26,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 403 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states. [2022-01-10 08:20:26,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 6965. [2022-01-10 08:20:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6965 states, 5412 states have (on average 1.2021433850702143) internal successors, (6506), 5579 states have internal predecessors, (6506), 734 states have call successors, (734), 598 states have call predecessors, (734), 817 states have return successors, (1081), 792 states have call predecessors, (1081), 731 states have call successors, (1081) [2022-01-10 08:20:26,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6965 states to 6965 states and 8321 transitions. [2022-01-10 08:20:26,481 INFO L78 Accepts]: Start accepts. Automaton has 6965 states and 8321 transitions. Word has length 93 [2022-01-10 08:20:26,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:26,482 INFO L470 AbstractCegarLoop]: Abstraction has 6965 states and 8321 transitions. [2022-01-10 08:20:26,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-10 08:20:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 6965 states and 8321 transitions. [2022-01-10 08:20:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-10 08:20:26,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:26,485 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 08:20:26,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:26,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:26,694 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:26,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2008597495, now seen corresponding path program 1 times [2022-01-10 08:20:26,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:26,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807408619] [2022-01-10 08:20:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:26,695 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:26,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:26,696 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:26,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-01-10 08:20:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:26,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:20:26,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 08:20:26,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:26,874 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:26,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807408619] [2022-01-10 08:20:26,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807408619] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:26,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:26,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:20:26,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472766080] [2022-01-10 08:20:26,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:26,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:20:26,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:26,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:20:26,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:26,875 INFO L87 Difference]: Start difference. First operand 6965 states and 8321 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 08:20:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:27,141 INFO L93 Difference]: Finished difference Result 12317 states and 14705 transitions. [2022-01-10 08:20:27,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:20:27,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 08:20:27,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:27,161 INFO L225 Difference]: With dead ends: 12317 [2022-01-10 08:20:27,161 INFO L226 Difference]: Without dead ends: 6692 [2022-01-10 08:20:27,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:27,172 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 102 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 621 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 08:20:27,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 621 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:27,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6692 states. [2022-01-10 08:20:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6692 to 6689. [2022-01-10 08:20:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6689 states, 5206 states have (on average 1.1920860545524394) internal successors, (6206), 5367 states have internal predecessors, (6206), 696 states have call successors, (696), 570 states have call predecessors, (696), 785 states have return successors, (964), 754 states have call predecessors, (964), 693 states have call successors, (964) [2022-01-10 08:20:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 7866 transitions. [2022-01-10 08:20:27,529 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 7866 transitions. Word has length 93 [2022-01-10 08:20:27,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:27,530 INFO L470 AbstractCegarLoop]: Abstraction has 6689 states and 7866 transitions. [2022-01-10 08:20:27,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 08:20:27,530 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 7866 transitions. [2022-01-10 08:20:27,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-01-10 08:20:27,533 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:27,533 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, 1] [2022-01-10 08:20:27,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:27,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:27,742 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:27,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:27,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2044665117, now seen corresponding path program 1 times [2022-01-10 08:20:27,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:27,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958067911] [2022-01-10 08:20:27,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:27,742 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:27,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:27,743 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:27,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-01-10 08:20:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:27,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:20:27,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:27,915 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 08:20:27,915 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:27,916 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:27,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958067911] [2022-01-10 08:20:27,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958067911] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:27,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:27,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:20:27,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482457735] [2022-01-10 08:20:27,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:27,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:20:27,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:27,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:20:27,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:27,917 INFO L87 Difference]: Start difference. First operand 6689 states and 7866 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 08:20:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:28,164 INFO L93 Difference]: Finished difference Result 8743 states and 10346 transitions. [2022-01-10 08:20:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:20:28,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 94 [2022-01-10 08:20:28,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:28,179 INFO L225 Difference]: With dead ends: 8743 [2022-01-10 08:20:28,179 INFO L226 Difference]: Without dead ends: 6965 [2022-01-10 08:20:28,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:28,183 INFO L933 BasicCegarLoop]: 373 mSDtfsCounter, 96 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 638 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 08:20:28,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 638 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states. [2022-01-10 08:20:28,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 6965. [2022-01-10 08:20:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6965 states, 5430 states have (on average 1.1876611418047882) internal successors, (6449), 5591 states have internal predecessors, (6449), 726 states have call successors, (726), 590 states have call predecessors, (726), 807 states have return successors, (1006), 786 states have call predecessors, (1006), 723 states have call successors, (1006) [2022-01-10 08:20:28,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6965 states to 6965 states and 8181 transitions. [2022-01-10 08:20:28,515 INFO L78 Accepts]: Start accepts. Automaton has 6965 states and 8181 transitions. Word has length 94 [2022-01-10 08:20:28,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:28,515 INFO L470 AbstractCegarLoop]: Abstraction has 6965 states and 8181 transitions. [2022-01-10 08:20:28,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 08:20:28,515 INFO L276 IsEmpty]: Start isEmpty. Operand 6965 states and 8181 transitions. [2022-01-10 08:20:28,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-01-10 08:20:28,520 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:28,520 INFO L514 BasicCegarLoop]: trace histogram [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, 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 08:20:28,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:28,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:28,729 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:28,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:28,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1456366293, now seen corresponding path program 1 times [2022-01-10 08:20:28,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:28,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033628237] [2022-01-10 08:20:28,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:28,730 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:28,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:28,731 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:28,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-01-10 08:20:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:28,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 08:20:28,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:28,966 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 08:20:28,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:28,967 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:28,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033628237] [2022-01-10 08:20:28,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033628237] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:28,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:28,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 08:20:28,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505195261] [2022-01-10 08:20:28,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:28,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:20:28,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:28,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:20:28,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:20:28,968 INFO L87 Difference]: Start difference. First operand 6965 states and 8181 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 08:20:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:29,328 INFO L93 Difference]: Finished difference Result 8565 states and 10102 transitions. [2022-01-10 08:20:29,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 08:20:29,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 135 [2022-01-10 08:20:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:29,349 INFO L225 Difference]: With dead ends: 8565 [2022-01-10 08:20:29,349 INFO L226 Difference]: Without dead ends: 6977 [2022-01-10 08:20:29,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 08:20:29,355 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 293 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:29,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 480 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:20:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6977 states. [2022-01-10 08:20:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6977 to 6977. [2022-01-10 08:20:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6977 states, 5438 states have (on average 1.1833394630378815) internal successors, (6435), 5601 states have internal predecessors, (6435), 726 states have call successors, (726), 590 states have call predecessors, (726), 811 states have return successors, (994), 788 states have call predecessors, (994), 723 states have call successors, (994) [2022-01-10 08:20:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6977 states to 6977 states and 8155 transitions. [2022-01-10 08:20:29,775 INFO L78 Accepts]: Start accepts. Automaton has 6977 states and 8155 transitions. Word has length 135 [2022-01-10 08:20:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:29,775 INFO L470 AbstractCegarLoop]: Abstraction has 6977 states and 8155 transitions. [2022-01-10 08:20:29,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 08:20:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 6977 states and 8155 transitions. [2022-01-10 08:20:29,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-01-10 08:20:29,779 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:29,780 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] [2022-01-10 08:20:29,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:29,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:29,989 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:29,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1782103125, now seen corresponding path program 1 times [2022-01-10 08:20:29,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:29,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139624792] [2022-01-10 08:20:29,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:29,990 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:29,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:29,991 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:29,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-01-10 08:20:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:30,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:20:30,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-10 08:20:30,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:30,210 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:30,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139624792] [2022-01-10 08:20:30,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139624792] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:30,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:30,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:20:30,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559354364] [2022-01-10 08:20:30,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:30,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:20:30,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:30,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:20:30,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:30,211 INFO L87 Difference]: Start difference. First operand 6977 states and 8155 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 08:20:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:30,423 INFO L93 Difference]: Finished difference Result 8263 states and 9714 transitions. [2022-01-10 08:20:30,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:20:30,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 136 [2022-01-10 08:20:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:30,441 INFO L225 Difference]: With dead ends: 8263 [2022-01-10 08:20:30,441 INFO L226 Difference]: Without dead ends: 6985 [2022-01-10 08:20:30,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:30,446 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 101 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:30,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 569 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:30,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6985 states. [2022-01-10 08:20:30,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6985 to 6977. [2022-01-10 08:20:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6977 states, 5438 states have (on average 1.1759838175799926) internal successors, (6395), 5601 states have internal predecessors, (6395), 726 states have call successors, (726), 590 states have call predecessors, (726), 811 states have return successors, (994), 788 states have call predecessors, (994), 723 states have call successors, (994) [2022-01-10 08:20:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6977 states to 6977 states and 8115 transitions. [2022-01-10 08:20:30,896 INFO L78 Accepts]: Start accepts. Automaton has 6977 states and 8115 transitions. Word has length 136 [2022-01-10 08:20:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:30,897 INFO L470 AbstractCegarLoop]: Abstraction has 6977 states and 8115 transitions. [2022-01-10 08:20:30,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 08:20:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 6977 states and 8115 transitions. [2022-01-10 08:20:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-10 08:20:30,902 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:30,903 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 08:20:30,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:31,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:31,112 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1021717307, now seen corresponding path program 1 times [2022-01-10 08:20:31,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:31,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483285567] [2022-01-10 08:20:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:31,113 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:31,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:31,114 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:31,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-01-10 08:20:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:31,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 08:20:31,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 08:20:31,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 08:20:31,581 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 08:20:31,582 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:31,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483285567] [2022-01-10 08:20:31,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483285567] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 08:20:31,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 08:20:31,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-01-10 08:20:31,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634400401] [2022-01-10 08:20:31,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:31,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 08:20:31,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:31,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 08:20:31,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:20:31,583 INFO L87 Difference]: Start difference. First operand 6977 states and 8115 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 08:20:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:32,015 INFO L93 Difference]: Finished difference Result 8570 states and 9924 transitions. [2022-01-10 08:20:32,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 08:20:32,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 137 [2022-01-10 08:20:32,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:32,038 INFO L225 Difference]: With dead ends: 8570 [2022-01-10 08:20:32,038 INFO L226 Difference]: Without dead ends: 8567 [2022-01-10 08:20:32,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 08:20:32,041 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 343 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:32,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 695 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 08:20:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8567 states. [2022-01-10 08:20:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8567 to 7629. [2022-01-10 08:20:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7629 states, 5974 states have (on average 1.172246401071309) internal successors, (7003), 6143 states have internal predecessors, (7003), 790 states have call successors, (790), 634 states have call predecessors, (790), 863 states have return successors, (1072), 854 states have call predecessors, (1072), 787 states have call successors, (1072) [2022-01-10 08:20:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7629 states to 7629 states and 8865 transitions. [2022-01-10 08:20:32,426 INFO L78 Accepts]: Start accepts. Automaton has 7629 states and 8865 transitions. Word has length 137 [2022-01-10 08:20:32,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:32,426 INFO L470 AbstractCegarLoop]: Abstraction has 7629 states and 8865 transitions. [2022-01-10 08:20:32,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-10 08:20:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 7629 states and 8865 transitions. [2022-01-10 08:20:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-01-10 08:20:32,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:32,430 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 08:20:32,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:32,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:32,631 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:32,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash -72735443, now seen corresponding path program 1 times [2022-01-10 08:20:32,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:32,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001893721] [2022-01-10 08:20:32,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:32,632 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:32,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:32,633 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:32,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-01-10 08:20:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 08:20:32,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 08:20:32,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 08:20:32,866 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 08:20:32,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 08:20:32,866 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 08:20:32,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001893721] [2022-01-10 08:20:32,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001893721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 08:20:32,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 08:20:32,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 08:20:32,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922788689] [2022-01-10 08:20:32,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 08:20:32,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 08:20:32,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 08:20:32,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 08:20:32,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:32,868 INFO L87 Difference]: Start difference. First operand 7629 states and 8865 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-10 08:20:33,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 08:20:33,333 INFO L93 Difference]: Finished difference Result 9793 states and 11514 transitions. [2022-01-10 08:20:33,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 08:20:33,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 141 [2022-01-10 08:20:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 08:20:33,356 INFO L225 Difference]: With dead ends: 9793 [2022-01-10 08:20:33,356 INFO L226 Difference]: Without dead ends: 8197 [2022-01-10 08:20:33,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 08:20:33,364 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 45 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 08:20:33,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 607 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 08:20:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8197 states. [2022-01-10 08:20:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8197 to 7633. [2022-01-10 08:20:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7633 states, 5978 states have (on average 1.1721311475409837) internal successors, (7007), 6147 states have internal predecessors, (7007), 790 states have call successors, (790), 634 states have call predecessors, (790), 863 states have return successors, (1072), 854 states have call predecessors, (1072), 787 states have call successors, (1072) [2022-01-10 08:20:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 8869 transitions. [2022-01-10 08:20:33,749 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 8869 transitions. Word has length 141 [2022-01-10 08:20:33,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 08:20:33,750 INFO L470 AbstractCegarLoop]: Abstraction has 7633 states and 8869 transitions. [2022-01-10 08:20:33,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-10 08:20:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 8869 transitions. [2022-01-10 08:20:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-01-10 08:20:33,754 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 08:20:33,755 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 08:20:33,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:33,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:33,955 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 08:20:33,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 08:20:33,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1025674187, now seen corresponding path program 1 times [2022-01-10 08:20:33,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 08:20:33,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665753163] [2022-01-10 08:20:33,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 08:20:33,956 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 08:20:33,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 08:20:33,957 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 08:20:33,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-01-10 08:20:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 08:20:34,023 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 08:20:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 08:20:34,251 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 08:20:34,252 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 08:20:34,253 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-10 08:20:34,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-10 08:20:34,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-01-10 08:20:34,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 08:20:34,458 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, 1] [2022-01-10 08:20:34,460 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 08:20:34,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:20:34 BoogieIcfgContainer [2022-01-10 08:20:34,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 08:20:34,578 INFO L158 Benchmark]: Toolchain (without parser) took 28364.62ms. Allocated memory was 169.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 119.0MB in the beginning and 763.4MB in the end (delta: -644.4MB). Peak memory consumption was 659.3MB. Max. memory is 8.0GB. [2022-01-10 08:20:34,578 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 169.9MB. Free memory was 135.6MB in the beginning and 135.5MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 08:20:34,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.18ms. Allocated memory is still 169.9MB. Free memory was 118.7MB in the beginning and 139.9MB in the end (delta: -21.2MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-01-10 08:20:34,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.87ms. Allocated memory is still 169.9MB. Free memory was 139.9MB in the beginning and 137.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 08:20:34,579 INFO L158 Benchmark]: Boogie Preprocessor took 39.99ms. Allocated memory is still 169.9MB. Free memory was 137.3MB in the beginning and 135.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 08:20:34,579 INFO L158 Benchmark]: RCFGBuilder took 502.06ms. Allocated memory is still 169.9MB. Free memory was 135.2MB in the beginning and 111.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-01-10 08:20:34,579 INFO L158 Benchmark]: TraceAbstraction took 27436.88ms. Allocated memory was 169.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 111.1MB in the beginning and 763.4MB in the end (delta: -652.3MB). Peak memory consumption was 651.6MB. Max. memory is 8.0GB. [2022-01-10 08:20:34,580 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.11ms. Allocated memory is still 169.9MB. Free memory was 135.6MB in the beginning and 135.5MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 332.18ms. Allocated memory is still 169.9MB. Free memory was 118.7MB in the beginning and 139.9MB in the end (delta: -21.2MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.87ms. Allocated memory is still 169.9MB. Free memory was 139.9MB in the beginning and 137.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.99ms. Allocated memory is still 169.9MB. Free memory was 137.3MB in the beginning and 135.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 502.06ms. Allocated memory is still 169.9MB. Free memory was 135.2MB in the beginning and 111.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 27436.88ms. Allocated memory was 169.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 111.1MB in the beginning and 763.4MB in the end (delta: -652.3MB). Peak memory consumption was 651.6MB. 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=2147483648, 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=2147483648, 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=2147483648, 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, 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, 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, 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, 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, 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=2147483648, tmp_ndt_2=2147483648, 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=2147483648, tmp_ndt_2=2147483648, 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=2147483648, tmp_ndt_2=2147483648, 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, 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, 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, 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: 27.3s, OverallIterations: 30, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6616 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6445 mSDsluCounter, 19781 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10886 mSDsCounter, 684 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2714 IncrementalHoareTripleChecker+Invalid, 3398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 684 mSolverCounterUnsat, 8895 mSDtfsCounter, 2714 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2518 GetRequests, 2437 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7633occurred in iteration=29, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 4235 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2457 NumberOfCodeBlocks, 2457 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2495 ConstructedInterpolants, 0 QuantifiedInterpolants, 4562 SizeOfPredicates, 11 NumberOfNonLiveVariables, 5046 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 31 InterpolantComputations, 28 PerfectInterpolantSequences, 534/554 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 08:20:34,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...