/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:47:34,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:47:34,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:47:34,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:47:34,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:47:34,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:47:34,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:47:34,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:47:34,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:47:34,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:47:34,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:47:34,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:47:34,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:47:34,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:47:34,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:47:34,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:47:34,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:47:34,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:47:34,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:47:34,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:47:34,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:47:34,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:47:34,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:47:34,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:47:34,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:47:34,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:47:34,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:47:34,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:47:34,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:47:34,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:47:34,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:47:34,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:47:34,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:47:34,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:47:34,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:47:34,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:47:34,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:47:34,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:47:34,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:47:34,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:47:34,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:47:34,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:47:34,494 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:47:34,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:47:34,496 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:47:34,496 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:47:34,496 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:47:34,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:47:34,497 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:47:34,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:47:34,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:47:34,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:47:34,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:47:34,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:47:34,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:47:34,498 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:47:34,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:47:34,498 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:47:34,499 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:47:34,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:47:34,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:47:34,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:47:34,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:47:34,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:47:34,500 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:47:34,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:47:34,500 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:47:34,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:47:34,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:47:34,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:47:34,501 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:47:34,501 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:47:34,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:47:34,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:47:34,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:47:34,990 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:47:34,991 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:47:34,992 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c [2020-09-04 13:47:35,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/592c129f1/2d3c28e3e9d1413c94bce02748ffb856/FLAGab52575ab [2020-09-04 13:47:35,684 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:47:35,685 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c [2020-09-04 13:47:35,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/592c129f1/2d3c28e3e9d1413c94bce02748ffb856/FLAGab52575ab [2020-09-04 13:47:35,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/592c129f1/2d3c28e3e9d1413c94bce02748ffb856 [2020-09-04 13:47:35,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:47:35,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:47:35,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:47:35,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:47:35,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:47:35,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:47:35" (1/1) ... [2020-09-04 13:47:35,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a0aa91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:35, skipping insertion in model container [2020-09-04 13:47:35,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:47:35" (1/1) ... [2020-09-04 13:47:35,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:47:35,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:47:36,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:47:36,339 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:47:36,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:47:36,499 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:47:36,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:36 WrapperNode [2020-09-04 13:47:36,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:47:36,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:47:36,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:47:36,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:47:36,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:36" (1/1) ... [2020-09-04 13:47:36,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:36" (1/1) ... [2020-09-04 13:47:36,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:36" (1/1) ... [2020-09-04 13:47:36,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:36" (1/1) ... [2020-09-04 13:47:36,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:36" (1/1) ... [2020-09-04 13:47:36,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:36" (1/1) ... [2020-09-04 13:47:36,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:36" (1/1) ... [2020-09-04 13:47:36,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:47:36,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:47:36,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:47:36,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:47:36,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:36" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:47:36,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:47:36,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:47:36,628 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-09-04 13:47:36,628 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2020-09-04 13:47:36,628 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-09-04 13:47:36,628 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-09-04 13:47:36,629 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-09-04 13:47:36,629 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-09-04 13:47:36,629 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-09-04 13:47:36,629 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-09-04 13:47:36,630 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-09-04 13:47:36,630 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-09-04 13:47:36,630 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-09-04 13:47:36,630 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-09-04 13:47:36,631 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-09-04 13:47:36,631 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-09-04 13:47:36,631 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-09-04 13:47:36,631 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-09-04 13:47:36,631 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-09-04 13:47:36,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:47:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:47:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:47:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-09-04 13:47:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2020-09-04 13:47:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-09-04 13:47:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-09-04 13:47:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-09-04 13:47:36,633 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-09-04 13:47:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-09-04 13:47:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-09-04 13:47:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-09-04 13:47:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-09-04 13:47:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-09-04 13:47:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-09-04 13:47:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-09-04 13:47:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-09-04 13:47:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-09-04 13:47:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-09-04 13:47:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-09-04 13:47:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:47:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:47:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:47:37,143 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:47:37,143 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-09-04 13:47:37,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:47:37 BoogieIcfgContainer [2020-09-04 13:47:37,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:47:37,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:47:37,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:47:37,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:47:37,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:47:35" (1/3) ... [2020-09-04 13:47:37,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4926988c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:47:37, skipping insertion in model container [2020-09-04 13:47:37,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:47:36" (2/3) ... [2020-09-04 13:47:37,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4926988c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:47:37, skipping insertion in model container [2020-09-04 13:47:37,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:47:37" (3/3) ... [2020-09-04 13:47:37,162 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2020-09-04 13:47:37,172 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:47:37,183 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:47:37,207 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:47:37,241 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:47:37,241 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:47:37,241 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:47:37,241 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:47:37,241 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:47:37,241 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:47:37,242 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:47:37,242 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:47:37,279 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2020-09-04 13:47:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 13:47:37,292 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:47:37,293 INFO L422 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] [2020-09-04 13:47:37,294 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:47:37,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:47:37,301 INFO L82 PathProgramCache]: Analyzing trace with hash 742963907, now seen corresponding path program 1 times [2020-09-04 13:47:37,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:47:37,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426484196] [2020-09-04 13:47:37,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:47:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:37,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:47:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:37,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:47:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:37,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:47:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:37,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:47:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:37,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:47:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:38,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:47:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:38,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:47:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:38,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:47:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:38,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 13:47:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:38,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 13:47:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:47:38,078 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426484196] [2020-09-04 13:47:38,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:47:38,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:47:38,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080689513] [2020-09-04 13:47:38,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:47:38,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:47:38,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:47:38,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:47:38,137 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 10 states. [2020-09-04 13:47:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:47:41,072 INFO L93 Difference]: Finished difference Result 552 states and 918 transitions. [2020-09-04 13:47:41,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 13:47:41,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-09-04 13:47:41,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:47:41,098 INFO L225 Difference]: With dead ends: 552 [2020-09-04 13:47:41,099 INFO L226 Difference]: Without dead ends: 416 [2020-09-04 13:47:41,108 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2020-09-04 13:47:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2020-09-04 13:47:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 234. [2020-09-04 13:47:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-09-04 13:47:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 306 transitions. [2020-09-04 13:47:41,263 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 306 transitions. Word has length 70 [2020-09-04 13:47:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:47:41,263 INFO L479 AbstractCegarLoop]: Abstraction has 234 states and 306 transitions. [2020-09-04 13:47:41,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:47:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 306 transitions. [2020-09-04 13:47:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 13:47:41,268 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:47:41,269 INFO L422 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] [2020-09-04 13:47:41,269 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:47:41,269 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:47:41,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:47:41,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1190139517, now seen corresponding path program 1 times [2020-09-04 13:47:41,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:47:41,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849337914] [2020-09-04 13:47:41,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:47:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:41,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:47:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:41,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:47:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:41,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:47:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:41,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:47:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:41,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:47:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:41,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:47:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:41,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:47:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:41,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:47:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:41,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 13:47:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:41,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 13:47:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:47:41,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849337914] [2020-09-04 13:47:41,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:47:41,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:47:41,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080159292] [2020-09-04 13:47:41,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:47:41,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:47:41,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:47:41,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:47:41,543 INFO L87 Difference]: Start difference. First operand 234 states and 306 transitions. Second operand 10 states. [2020-09-04 13:47:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:47:44,923 INFO L93 Difference]: Finished difference Result 805 states and 1159 transitions. [2020-09-04 13:47:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 13:47:44,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-09-04 13:47:44,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:47:44,935 INFO L225 Difference]: With dead ends: 805 [2020-09-04 13:47:44,935 INFO L226 Difference]: Without dead ends: 598 [2020-09-04 13:47:44,943 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2020-09-04 13:47:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-09-04 13:47:45,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 360. [2020-09-04 13:47:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-09-04 13:47:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 476 transitions. [2020-09-04 13:47:45,039 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 476 transitions. Word has length 70 [2020-09-04 13:47:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:47:45,039 INFO L479 AbstractCegarLoop]: Abstraction has 360 states and 476 transitions. [2020-09-04 13:47:45,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:47:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 476 transitions. [2020-09-04 13:47:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 13:47:45,043 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:47:45,044 INFO L422 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] [2020-09-04 13:47:45,044 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:47:45,044 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:47:45,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:47:45,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1543227899, now seen corresponding path program 1 times [2020-09-04 13:47:45,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:47:45,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166082308] [2020-09-04 13:47:45,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:47:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:45,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:47:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:45,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:47:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:45,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:47:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:45,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:47:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:45,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:47:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:45,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:47:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:45,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:47:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:45,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:47:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:45,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 13:47:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:45,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 13:47:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:47:45,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166082308] [2020-09-04 13:47:45,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:47:45,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 13:47:45,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874880174] [2020-09-04 13:47:45,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 13:47:45,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:47:45,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 13:47:45,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:47:45,358 INFO L87 Difference]: Start difference. First operand 360 states and 476 transitions. Second operand 11 states. [2020-09-04 13:47:47,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:47:47,309 INFO L93 Difference]: Finished difference Result 858 states and 1207 transitions. [2020-09-04 13:47:47,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 13:47:47,310 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2020-09-04 13:47:47,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:47:47,316 INFO L225 Difference]: With dead ends: 858 [2020-09-04 13:47:47,316 INFO L226 Difference]: Without dead ends: 541 [2020-09-04 13:47:47,318 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:47:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2020-09-04 13:47:47,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 365. [2020-09-04 13:47:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2020-09-04 13:47:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 479 transitions. [2020-09-04 13:47:47,372 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 479 transitions. Word has length 70 [2020-09-04 13:47:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:47:47,373 INFO L479 AbstractCegarLoop]: Abstraction has 365 states and 479 transitions. [2020-09-04 13:47:47,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 13:47:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 479 transitions. [2020-09-04 13:47:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 13:47:47,375 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:47:47,376 INFO L422 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] [2020-09-04 13:47:47,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:47:47,376 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:47:47,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:47:47,377 INFO L82 PathProgramCache]: Analyzing trace with hash 507756099, now seen corresponding path program 1 times [2020-09-04 13:47:47,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:47:47,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287032866] [2020-09-04 13:47:47,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:47:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:47,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:47:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:47,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:47:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:47,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:47:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:47,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:47:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:47,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:47:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:47,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:47:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:47,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:47:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:47,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:47:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:47,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 13:47:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:47,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 13:47:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:47:47,656 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287032866] [2020-09-04 13:47:47,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:47:47,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:47:47,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92330497] [2020-09-04 13:47:47,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:47:47,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:47:47,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:47:47,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:47:47,659 INFO L87 Difference]: Start difference. First operand 365 states and 479 transitions. Second operand 10 states. [2020-09-04 13:47:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:47:50,583 INFO L93 Difference]: Finished difference Result 1300 states and 1859 transitions. [2020-09-04 13:47:50,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 13:47:50,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-09-04 13:47:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:47:50,633 INFO L225 Difference]: With dead ends: 1300 [2020-09-04 13:47:50,634 INFO L226 Difference]: Without dead ends: 978 [2020-09-04 13:47:50,637 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2020-09-04 13:47:50,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2020-09-04 13:47:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 691. [2020-09-04 13:47:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-09-04 13:47:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 892 transitions. [2020-09-04 13:47:50,737 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 892 transitions. Word has length 70 [2020-09-04 13:47:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:47:50,738 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 892 transitions. [2020-09-04 13:47:50,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:47:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 892 transitions. [2020-09-04 13:47:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 13:47:50,740 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:47:50,741 INFO L422 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] [2020-09-04 13:47:50,741 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:47:50,741 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:47:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:47:50,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1263714876, now seen corresponding path program 1 times [2020-09-04 13:47:50,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:47:50,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761050373] [2020-09-04 13:47:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:47:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:50,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:47:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:50,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:47:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:50,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:47:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:50,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:47:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:50,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:47:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:50,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:47:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:50,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:47:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:50,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:47:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:51,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 13:47:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:51,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 13:47:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:47:51,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761050373] [2020-09-04 13:47:51,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:47:51,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 13:47:51,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793616258] [2020-09-04 13:47:51,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 13:47:51,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:47:51,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 13:47:51,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:47:51,030 INFO L87 Difference]: Start difference. First operand 691 states and 892 transitions. Second operand 11 states. [2020-09-04 13:47:53,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:47:53,242 INFO L93 Difference]: Finished difference Result 1616 states and 2202 transitions. [2020-09-04 13:47:53,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 13:47:53,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2020-09-04 13:47:53,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:47:53,255 INFO L225 Difference]: With dead ends: 1616 [2020-09-04 13:47:53,255 INFO L226 Difference]: Without dead ends: 968 [2020-09-04 13:47:53,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2020-09-04 13:47:53,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2020-09-04 13:47:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 706. [2020-09-04 13:47:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2020-09-04 13:47:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 904 transitions. [2020-09-04 13:47:53,337 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 904 transitions. Word has length 70 [2020-09-04 13:47:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:47:53,337 INFO L479 AbstractCegarLoop]: Abstraction has 706 states and 904 transitions. [2020-09-04 13:47:53,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 13:47:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 904 transitions. [2020-09-04 13:47:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 13:47:53,340 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:47:53,341 INFO L422 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] [2020-09-04 13:47:53,341 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:47:53,342 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:47:53,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:47:53,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1123166266, now seen corresponding path program 1 times [2020-09-04 13:47:53,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:47:53,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347526166] [2020-09-04 13:47:53,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:47:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:53,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:47:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:53,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 13:47:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:53,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 13:47:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:53,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-09-04 13:47:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:53,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-04 13:47:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:53,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-09-04 13:47:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:53,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-09-04 13:47:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:53,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:47:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:53,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-09-04 13:47:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:53,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-09-04 13:47:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:47:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:47:53,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347526166] [2020-09-04 13:47:53,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:47:53,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 13:47:53,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410896431] [2020-09-04 13:47:53,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:47:53,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:47:53,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:47:53,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:47:53,581 INFO L87 Difference]: Start difference. First operand 706 states and 904 transitions. Second operand 10 states. [2020-09-04 13:47:56,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:47:56,581 INFO L93 Difference]: Finished difference Result 1675 states and 2255 transitions. [2020-09-04 13:47:56,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 13:47:56,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-09-04 13:47:56,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:47:56,598 INFO L225 Difference]: With dead ends: 1675 [2020-09-04 13:47:56,598 INFO L226 Difference]: Without dead ends: 1111 [2020-09-04 13:47:56,601 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2020-09-04 13:47:56,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2020-09-04 13:47:56,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 722. [2020-09-04 13:47:56,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2020-09-04 13:47:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 913 transitions. [2020-09-04 13:47:56,682 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 913 transitions. Word has length 70 [2020-09-04 13:47:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:47:56,683 INFO L479 AbstractCegarLoop]: Abstraction has 722 states and 913 transitions. [2020-09-04 13:47:56,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:47:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 913 transitions. [2020-09-04 13:47:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 13:47:56,685 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:47:56,685 INFO L422 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] [2020-09-04 13:47:56,685 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:47:56,685 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:47:56,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:47:56,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1940814716, now seen corresponding path program 1 times [2020-09-04 13:47:56,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:47:56,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124194446] [2020-09-04 13:47:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:47:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:47:56,720 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:47:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:47:56,753 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:47:56,831 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-04 13:47:56,831 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 13:47:56,832 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:47:56,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:47:56 BoogieIcfgContainer [2020-09-04 13:47:56,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:47:56,982 INFO L168 Benchmark]: Toolchain (without parser) took 21046.19 ms. Allocated memory was 145.8 MB in the beginning and 474.0 MB in the end (delta: 328.2 MB). Free memory was 101.8 MB in the beginning and 322.3 MB in the end (delta: -220.5 MB). Peak memory consumption was 107.7 MB. Max. memory is 7.1 GB. [2020-09-04 13:47:56,983 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 145.8 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-09-04 13:47:56,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 564.27 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 101.6 MB in the beginning and 179.1 MB in the end (delta: -77.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:47:56,990 INFO L168 Benchmark]: Boogie Preprocessor took 52.73 ms. Allocated memory is still 202.4 MB. Free memory was 179.1 MB in the beginning and 176.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-09-04 13:47:56,991 INFO L168 Benchmark]: RCFGBuilder took 597.53 ms. Allocated memory is still 202.4 MB. Free memory was 176.7 MB in the beginning and 145.2 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 7.1 GB. [2020-09-04 13:47:56,992 INFO L168 Benchmark]: TraceAbstraction took 19824.33 ms. Allocated memory was 202.4 MB in the beginning and 474.0 MB in the end (delta: 271.6 MB). Free memory was 144.5 MB in the beginning and 322.3 MB in the end (delta: -177.8 MB). Peak memory consumption was 93.8 MB. Max. memory is 7.1 GB. [2020-09-04 13:47:57,005 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 145.8 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 564.27 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 101.6 MB in the beginning and 179.1 MB in the end (delta: -77.6 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.73 ms. Allocated memory is still 202.4 MB. Free memory was 179.1 MB in the beginning and 176.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 597.53 ms. Allocated memory is still 202.4 MB. Free memory was 176.7 MB in the beginning and 145.2 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19824.33 ms. Allocated memory was 202.4 MB in the beginning and 474.0 MB in the end (delta: 271.6 MB). Free memory was 144.5 MB in the beginning and 322.3 MB in the end (delta: -177.8 MB). Peak memory consumption was 93.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int q_buf_0 ; [L16] int q_free ; [L17] int q_read_ev ; [L18] int q_write_ev ; [L19] int q_req_up ; [L20] int q_ev ; [L41] int p_num_write ; [L42] int p_last_write ; [L43] int p_dw_st ; [L44] int p_dw_pc ; [L45] int p_dw_i ; [L46] int c_num_read ; [L47] int c_last_read ; [L48] int c_dr_st ; [L49] int c_dr_pc ; [L50] int c_dr_i ; [L154] static int a_t ; VAL [\old(a_t)=12, \old(c_dr_i)=3, \old(c_dr_pc)=14, \old(c_dr_st)=17, \old(c_last_read)=5, \old(c_num_read)=6, \old(p_dw_i)=4, \old(p_dw_pc)=15, \old(p_dw_st)=9, \old(p_last_write)=19, \old(p_num_write)=8, \old(q_buf_0)=10, \old(q_ev)=16, \old(q_free)=18, \old(q_read_ev)=13, \old(q_req_up)=11, \old(q_write_ev)=7, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=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] [L456] int __retres1 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=0, \old(q_read_ev)=0, \old(q_req_up)=0, \old(q_write_ev)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=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] [L460] CALL init_model() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=0, \old(q_read_ev)=0, \old(q_req_up)=0, \old(q_write_ev)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=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] [L442] q_free = 1 [L443] q_write_ev = 2 [L444] q_read_ev = q_write_ev [L445] p_num_write = 0 [L446] p_dw_pc = 0 [L447] p_dw_i = 1 [L448] c_num_read = 0 [L449] c_dr_pc = 0 [L450] c_dr_i = 1 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=0, \old(q_read_ev)=0, \old(q_req_up)=0, \old(q_write_ev)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L460] RET init_model() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=0, \old(q_read_ev)=0, \old(q_req_up)=0, \old(q_write_ev)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L461] CALL start_simulation() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L396] int kernel_st ; [L397] int tmp ; [L401] kernel_st = 0 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L402] CALL update_channels() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L212] COND FALSE !((int )q_req_up == 1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L402] RET update_channels() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L403] CALL init_threads() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L227] COND TRUE (int )p_dw_i == 1 [L228] p_dw_st = 0 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L232] COND TRUE (int )c_dr_i == 1 [L233] c_dr_st = 0 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L403] RET init_threads() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L404] CALL fire_delta_events() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L265] COND FALSE !((int )q_read_ev == 0) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L270] COND FALSE !((int )q_write_ev == 0) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L404] RET fire_delta_events() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L405] CALL activate_threads() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L298] int tmp ; [L299] int tmp___0 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L303] CALL, EXPR is_do_write_p_triggered() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L52] int __retres1 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L55] COND FALSE !((int )p_dw_pc == 1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L65] __retres1 = 0 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L67] return (__retres1); VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L303] RET, EXPR is_do_write_p_triggered() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, is_do_write_p_triggered()=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L303] tmp = is_do_write_p_triggered() [L305] COND FALSE !(\read(tmp)) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0] [L311] CALL, EXPR is_do_read_c_triggered() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L71] int __retres1 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L74] COND FALSE !((int )c_dr_pc == 1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L84] __retres1 = 0 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L86] return (__retres1); VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L311] RET, EXPR is_do_read_c_triggered() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, is_do_read_c_triggered()=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0] [L311] tmp___0 = is_do_read_c_triggered() [L313] COND FALSE !(\read(tmp___0)) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0, tmp___0=0] [L405] RET activate_threads() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L406] CALL reset_delta_events() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L283] COND FALSE !((int )q_read_ev == 1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L288] COND FALSE !((int )q_write_ev == 1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L406] RET reset_delta_events() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L409] COND TRUE 1 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L412] kernel_st = 1 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=1, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L413] CALL eval() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L323] int tmp ; [L324] int tmp___0 ; [L325] int tmp___1 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L329] COND TRUE 1 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L332] CALL, EXPR exists_runnable_thread() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L242] int __retres1 ; VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L245] COND TRUE (int )p_dw_st == 0 [L246] __retres1 = 1 VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L258] return (__retres1); VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, \result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L332] RET, EXPR exists_runnable_thread() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, exists_runnable_thread()=1, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp___1=1] [L339] COND TRUE (int )p_dw_st == 0 [L341] tmp = __VERIFIER_nondet_int() [L343] COND FALSE !(\read(tmp)) VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0, tmp___1=1] [L349] CALL error() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L10] __VERIFIER_error() VAL [\old(a_t)=0, \old(c_dr_i)=0, \old(c_dr_pc)=0, \old(c_dr_st)=0, \old(c_last_read)=0, \old(c_num_read)=0, \old(p_dw_i)=0, \old(p_dw_pc)=0, \old(p_dw_st)=0, \old(p_last_write)=0, \old(p_num_write)=0, \old(q_buf_0)=0, \old(q_ev)=0, \old(q_free)=1, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 20 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.5s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 986 SDtfs, 3575 SDslu, 1134 SDs, 0 SdLazy, 8326 SolverSat, 2232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 135 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=722occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 1534 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 490 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 91356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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! Received shutdown request...