/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks NOT_INCREMENTALLY -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 12:14:23,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 12:14:23,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 12:14:23,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 12:14:23,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 12:14:23,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 12:14:23,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 12:14:23,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 12:14:23,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 12:14:23,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 12:14:23,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 12:14:23,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 12:14:23,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 12:14:23,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 12:14:23,151 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 12:14:23,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 12:14:23,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 12:14:23,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 12:14:23,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 12:14:23,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 12:14:23,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 12:14:23,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 12:14:23,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 12:14:23,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 12:14:23,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 12:14:23,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 12:14:23,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 12:14:23,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 12:14:23,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 12:14:23,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 12:14:23,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 12:14:23,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 12:14:23,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 12:14:23,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 12:14:23,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 12:14:23,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 12:14:23,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 12:14:23,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 12:14:23,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 12:14:23,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 12:14:23,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 12:14:23,173 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 12:14:23,188 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 12:14:23,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 12:14:23,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 12:14:23,190 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 12:14:23,190 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 12:14:23,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 12:14:23,190 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 12:14:23,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 12:14:23,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 12:14:23,191 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 12:14:23,191 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 12:14:23,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 12:14:23,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 12:14:23,191 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 12:14:23,192 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 12:14:23,192 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 12:14:23,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 12:14:23,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 12:14:23,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 12:14:23,193 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 12:14:23,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 12:14:23,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 12:14:23,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 12:14:23,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 12:14:23,194 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 12:14:23,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 12:14:23,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:23,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 12:14:23,194 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 12:14:23,195 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> NOT_INCREMENTALLY [2020-07-21 12:14:23,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 12:14:23,494 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 12:14:23,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 12:14:23,499 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 12:14:23,499 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 12:14:23,500 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-21 12:14:23,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9468453/e6682dcdd8f348ee98acfecf7152a474/FLAGd9356e358 [2020-07-21 12:14:23,982 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 12:14:23,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-21 12:14:23,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9468453/e6682dcdd8f348ee98acfecf7152a474/FLAGd9356e358 [2020-07-21 12:14:24,340 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9468453/e6682dcdd8f348ee98acfecf7152a474 [2020-07-21 12:14:24,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 12:14:24,353 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 12:14:24,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 12:14:24,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 12:14:24,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 12:14:24,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:14:24" (1/1) ... [2020-07-21 12:14:24,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e796287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:14:24, skipping insertion in model container [2020-07-21 12:14:24,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:14:24" (1/1) ... [2020-07-21 12:14:24,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 12:14:24,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 12:14:24,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 12:14:24,596 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 12:14:24,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 12:14:24,651 INFO L208 MainTranslator]: Completed translation [2020-07-21 12:14:24,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:14:24 WrapperNode [2020-07-21 12:14:24,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 12:14:24,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 12:14:24,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 12:14:24,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 12:14:24,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:14:24" (1/1) ... [2020-07-21 12:14:24,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:14:24" (1/1) ... [2020-07-21 12:14:24,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:14:24" (1/1) ... [2020-07-21 12:14:24,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:14:24" (1/1) ... [2020-07-21 12:14:24,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:14:24" (1/1) ... [2020-07-21 12:14:24,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:14:24" (1/1) ... [2020-07-21 12:14:24,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:14:24" (1/1) ... [2020-07-21 12:14:24,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 12:14:24,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 12:14:24,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 12:14:24,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 12:14:24,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:14:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/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-07-21 12:14:24,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 12:14:24,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 12:14:24,931 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-21 12:14:24,931 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-07-21 12:14:24,931 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-07-21 12:14:24,932 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-07-21 12:14:24,932 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-07-21 12:14:24,932 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-07-21 12:14:24,933 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-21 12:14:24,933 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-21 12:14:24,933 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-21 12:14:24,933 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-21 12:14:24,934 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-21 12:14:24,934 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-21 12:14:24,934 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 12:14:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 12:14:24,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 12:14:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-21 12:14:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-07-21 12:14:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-07-21 12:14:24,936 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-07-21 12:14:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-07-21 12:14:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-07-21 12:14:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-21 12:14:24,937 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-21 12:14:24,938 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-21 12:14:24,938 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-21 12:14:24,938 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-21 12:14:24,938 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-21 12:14:24,939 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 12:14:24,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 12:14:24,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 12:14:25,444 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 12:14:25,444 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-21 12:14:25,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:14:25 BoogieIcfgContainer [2020-07-21 12:14:25,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 12:14:25,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 12:14:25,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 12:14:25,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 12:14:25,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 12:14:24" (1/3) ... [2020-07-21 12:14:25,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1a3d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:14:25, skipping insertion in model container [2020-07-21 12:14:25,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:14:24" (2/3) ... [2020-07-21 12:14:25,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b1a3d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:14:25, skipping insertion in model container [2020-07-21 12:14:25,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:14:25" (3/3) ... [2020-07-21 12:14:25,458 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-07-21 12:14:25,468 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 12:14:25,476 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 12:14:25,491 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 12:14:25,516 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 12:14:25,516 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 12:14:25,516 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 12:14:25,516 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 12:14:25,516 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 12:14:25,517 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 12:14:25,517 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 12:14:25,517 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 12:14:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2020-07-21 12:14:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-21 12:14:25,546 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:14:25,547 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] [2020-07-21 12:14:25,548 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:14:25,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:14:25,554 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2020-07-21 12:14:25,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:14:25,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [223539186] [2020-07-21 12:14:25,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:14:25,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 12:14:25,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:14:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:14:25,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:14:25,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [223539186] [2020-07-21 12:14:25,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:14:25,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:14:25,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787806245] [2020-07-21 12:14:25,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:14:25,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:14:25,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:14:25,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:25,851 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2020-07-21 12:14:25,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:14:25,941 INFO L93 Difference]: Finished difference Result 279 states and 392 transitions. [2020-07-21 12:14:25,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:14:25,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-21 12:14:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:14:25,960 INFO L225 Difference]: With dead ends: 279 [2020-07-21 12:14:25,961 INFO L226 Difference]: Without dead ends: 175 [2020-07-21 12:14:25,966 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:25,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-07-21 12:14:26,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2020-07-21 12:14:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-07-21 12:14:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 219 transitions. [2020-07-21 12:14:26,041 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 219 transitions. Word has length 65 [2020-07-21 12:14:26,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:14:26,042 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 219 transitions. [2020-07-21 12:14:26,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:14:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 219 transitions. [2020-07-21 12:14:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-21 12:14:26,048 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:14:26,048 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] [2020-07-21 12:14:26,262 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:26,263 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:14:26,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:14:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash -478691660, now seen corresponding path program 1 times [2020-07-21 12:14:26,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:14:26,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [97030749] [2020-07-21 12:14:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:14:26,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:14:26,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:14:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:14:26,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:14:26,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [97030749] [2020-07-21 12:14:26,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:14:26,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:14:26,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556359395] [2020-07-21 12:14:26,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:14:26,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:14:26,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:14:26,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:26,451 INFO L87 Difference]: Start difference. First operand 171 states and 219 transitions. Second operand 3 states. [2020-07-21 12:14:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:14:26,519 INFO L93 Difference]: Finished difference Result 468 states and 631 transitions. [2020-07-21 12:14:26,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:14:26,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-21 12:14:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:14:26,525 INFO L225 Difference]: With dead ends: 468 [2020-07-21 12:14:26,526 INFO L226 Difference]: Without dead ends: 314 [2020-07-21 12:14:26,529 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:26,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-07-21 12:14:26,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2020-07-21 12:14:26,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-07-21 12:14:26,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 412 transitions. [2020-07-21 12:14:26,576 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 412 transitions. Word has length 65 [2020-07-21 12:14:26,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:14:26,577 INFO L479 AbstractCegarLoop]: Abstraction has 310 states and 412 transitions. [2020-07-21 12:14:26,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:14:26,577 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 412 transitions. [2020-07-21 12:14:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 12:14:26,582 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:14:26,582 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] [2020-07-21 12:14:26,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:26,792 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:14:26,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:14:26,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1988256317, now seen corresponding path program 1 times [2020-07-21 12:14:26,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:14:26,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [296707660] [2020-07-21 12:14:26,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:14:26,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 12:14:26,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:14:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:14:26,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:14:26,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [296707660] [2020-07-21 12:14:26,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:14:26,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:14:26,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849494865] [2020-07-21 12:14:26,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:14:26,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:14:26,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:14:26,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:26,957 INFO L87 Difference]: Start difference. First operand 310 states and 412 transitions. Second operand 3 states. [2020-07-21 12:14:27,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:14:27,026 INFO L93 Difference]: Finished difference Result 882 states and 1239 transitions. [2020-07-21 12:14:27,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:14:27,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-21 12:14:27,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:14:27,036 INFO L225 Difference]: With dead ends: 882 [2020-07-21 12:14:27,036 INFO L226 Difference]: Without dead ends: 592 [2020-07-21 12:14:27,042 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:27,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-07-21 12:14:27,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 588. [2020-07-21 12:14:27,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-07-21 12:14:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 791 transitions. [2020-07-21 12:14:27,128 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 791 transitions. Word has length 66 [2020-07-21 12:14:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:14:27,128 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 791 transitions. [2020-07-21 12:14:27,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:14:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 791 transitions. [2020-07-21 12:14:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 12:14:27,136 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:14:27,136 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] [2020-07-21 12:14:27,350 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:27,351 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:14:27,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:14:27,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2101642974, now seen corresponding path program 1 times [2020-07-21 12:14:27,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:14:27,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1821568462] [2020-07-21 12:14:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:14:27,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-21 12:14:27,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:14:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:14:27,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:14:27,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1821568462] [2020-07-21 12:14:27,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:14:27,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:14:27,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918772959] [2020-07-21 12:14:27,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:14:27,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:14:27,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:14:27,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:27,488 INFO L87 Difference]: Start difference. First operand 588 states and 791 transitions. Second operand 3 states. [2020-07-21 12:14:27,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:14:27,559 INFO L93 Difference]: Finished difference Result 1301 states and 1786 transitions. [2020-07-21 12:14:27,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:14:27,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-21 12:14:27,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:14:27,567 INFO L225 Difference]: With dead ends: 1301 [2020-07-21 12:14:27,568 INFO L226 Difference]: Without dead ends: 802 [2020-07-21 12:14:27,571 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:27,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2020-07-21 12:14:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 673. [2020-07-21 12:14:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2020-07-21 12:14:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 907 transitions. [2020-07-21 12:14:27,648 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 907 transitions. Word has length 66 [2020-07-21 12:14:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:14:27,649 INFO L479 AbstractCegarLoop]: Abstraction has 673 states and 907 transitions. [2020-07-21 12:14:27,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:14:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 907 transitions. [2020-07-21 12:14:27,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-21 12:14:27,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:14:27,654 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:14:27,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:27,869 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:14:27,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:14:27,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1515944043, now seen corresponding path program 1 times [2020-07-21 12:14:27,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:14:27,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1451118833] [2020-07-21 12:14:27,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:14:27,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 12:14:27,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:14:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:14:28,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:14:28,004 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1451118833] [2020-07-21 12:14:28,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:14:28,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:14:28,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336983716] [2020-07-21 12:14:28,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:14:28,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:14:28,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:14:28,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:28,006 INFO L87 Difference]: Start difference. First operand 673 states and 907 transitions. Second operand 3 states. [2020-07-21 12:14:28,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:14:28,093 INFO L93 Difference]: Finished difference Result 1545 states and 2227 transitions. [2020-07-21 12:14:28,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:14:28,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-07-21 12:14:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:14:28,107 INFO L225 Difference]: With dead ends: 1545 [2020-07-21 12:14:28,108 INFO L226 Difference]: Without dead ends: 892 [2020-07-21 12:14:28,116 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2020-07-21 12:14:28,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2020-07-21 12:14:28,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2020-07-21 12:14:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1229 transitions. [2020-07-21 12:14:28,184 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1229 transitions. Word has length 86 [2020-07-21 12:14:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:14:28,184 INFO L479 AbstractCegarLoop]: Abstraction has 892 states and 1229 transitions. [2020-07-21 12:14:28,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:14:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1229 transitions. [2020-07-21 12:14:28,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-07-21 12:14:28,200 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:14:28,200 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 12:14:28,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:28,415 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:14:28,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:14:28,415 INFO L82 PathProgramCache]: Analyzing trace with hash 982228556, now seen corresponding path program 1 times [2020-07-21 12:14:28,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:14:28,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1777418926] [2020-07-21 12:14:28,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:14:28,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:14:28,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:14:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-07-21 12:14:28,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:14:28,592 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1777418926] [2020-07-21 12:14:28,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:14:28,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:14:28,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306484952] [2020-07-21 12:14:28,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:14:28,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:14:28,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:14:28,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:28,595 INFO L87 Difference]: Start difference. First operand 892 states and 1229 transitions. Second operand 3 states. [2020-07-21 12:14:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:14:28,661 INFO L93 Difference]: Finished difference Result 1667 states and 2281 transitions. [2020-07-21 12:14:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:14:28,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2020-07-21 12:14:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:14:28,668 INFO L225 Difference]: With dead ends: 1667 [2020-07-21 12:14:28,669 INFO L226 Difference]: Without dead ends: 794 [2020-07-21 12:14:28,673 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2020-07-21 12:14:28,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2020-07-21 12:14:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-07-21 12:14:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1072 transitions. [2020-07-21 12:14:28,730 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1072 transitions. Word has length 151 [2020-07-21 12:14:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:14:28,731 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 1072 transitions. [2020-07-21 12:14:28,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:14:28,731 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1072 transitions. [2020-07-21 12:14:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-07-21 12:14:28,735 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:14:28,735 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 12:14:28,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:28,951 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:14:28,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:14:28,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1973930899, now seen corresponding path program 1 times [2020-07-21 12:14:28,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:14:28,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1027366584] [2020-07-21 12:14:28,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:14:29,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 12:14:29,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:14:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-21 12:14:29,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:14:29,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1027366584] [2020-07-21 12:14:29,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:14:29,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 12:14:29,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884652234] [2020-07-21 12:14:29,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 12:14:29,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:14:29,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 12:14:29,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 12:14:29,210 INFO L87 Difference]: Start difference. First operand 794 states and 1072 transitions. Second operand 6 states. [2020-07-21 12:14:29,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:14:29,326 INFO L93 Difference]: Finished difference Result 1581 states and 2191 transitions. [2020-07-21 12:14:29,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 12:14:29,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2020-07-21 12:14:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:14:29,336 INFO L225 Difference]: With dead ends: 1581 [2020-07-21 12:14:29,336 INFO L226 Difference]: Without dead ends: 806 [2020-07-21 12:14:29,341 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-21 12:14:29,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2020-07-21 12:14:29,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 739. [2020-07-21 12:14:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-07-21 12:14:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 948 transitions. [2020-07-21 12:14:29,408 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 948 transitions. Word has length 148 [2020-07-21 12:14:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:14:29,409 INFO L479 AbstractCegarLoop]: Abstraction has 739 states and 948 transitions. [2020-07-21 12:14:29,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 12:14:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 948 transitions. [2020-07-21 12:14:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-07-21 12:14:29,413 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:14:29,414 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:14:29,628 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:29,629 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:14:29,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:14:29,630 INFO L82 PathProgramCache]: Analyzing trace with hash -491128401, now seen corresponding path program 1 times [2020-07-21 12:14:29,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:14:29,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1576462417] [2020-07-21 12:14:29,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:14:29,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 12:14:29,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:14:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-21 12:14:29,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:14:29,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1576462417] [2020-07-21 12:14:29,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:14:29,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:14:29,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323346392] [2020-07-21 12:14:29,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:14:29,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:14:29,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:14:29,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:29,835 INFO L87 Difference]: Start difference. First operand 739 states and 948 transitions. Second operand 3 states. [2020-07-21 12:14:29,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:14:29,904 INFO L93 Difference]: Finished difference Result 1174 states and 1542 transitions. [2020-07-21 12:14:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:14:29,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2020-07-21 12:14:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:14:29,912 INFO L225 Difference]: With dead ends: 1174 [2020-07-21 12:14:29,912 INFO L226 Difference]: Without dead ends: 753 [2020-07-21 12:14:29,915 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:29,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2020-07-21 12:14:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 739. [2020-07-21 12:14:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2020-07-21 12:14:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 946 transitions. [2020-07-21 12:14:29,965 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 946 transitions. Word has length 118 [2020-07-21 12:14:29,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:14:29,967 INFO L479 AbstractCegarLoop]: Abstraction has 739 states and 946 transitions. [2020-07-21 12:14:29,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:14:29,967 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 946 transitions. [2020-07-21 12:14:29,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-21 12:14:29,970 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:14:29,971 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:14:30,184 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:30,185 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:14:30,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:14:30,186 INFO L82 PathProgramCache]: Analyzing trace with hash -226598129, now seen corresponding path program 1 times [2020-07-21 12:14:30,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:14:30,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [343898284] [2020-07-21 12:14:30,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:14:30,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 12:14:30,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:14:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:14:30,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 12:14:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-21 12:14:30,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [343898284] [2020-07-21 12:14:30,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-21 12:14:30,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2020-07-21 12:14:30,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367556665] [2020-07-21 12:14:30,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-21 12:14:30,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:14:30,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-21 12:14:30,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-21 12:14:30,408 INFO L87 Difference]: Start difference. First operand 739 states and 946 transitions. Second operand 4 states. [2020-07-21 12:14:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:14:30,564 INFO L93 Difference]: Finished difference Result 807 states and 1047 transitions. [2020-07-21 12:14:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-21 12:14:30,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-07-21 12:14:30,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:14:30,571 INFO L225 Difference]: With dead ends: 807 [2020-07-21 12:14:30,571 INFO L226 Difference]: Without dead ends: 804 [2020-07-21 12:14:30,572 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-21 12:14:30,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2020-07-21 12:14:30,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 740. [2020-07-21 12:14:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2020-07-21 12:14:30,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 946 transitions. [2020-07-21 12:14:30,636 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 946 transitions. Word has length 98 [2020-07-21 12:14:30,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:14:30,636 INFO L479 AbstractCegarLoop]: Abstraction has 740 states and 946 transitions. [2020-07-21 12:14:30,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-21 12:14:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 946 transitions. [2020-07-21 12:14:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-21 12:14:30,641 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:14:30,641 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:14:30,854 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:30,855 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:14:30,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:14:30,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1565088270, now seen corresponding path program 1 times [2020-07-21 12:14:30,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:14:30,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [639109310] [2020-07-21 12:14:30,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:14:30,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-21 12:14:31,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:14:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 12:14:31,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 12:14:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-21 12:14:31,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [639109310] [2020-07-21 12:14:31,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 12:14:31,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2020-07-21 12:14:31,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021083048] [2020-07-21 12:14:31,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 12:14:31,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:14:31,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 12:14:31,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-21 12:14:31,229 INFO L87 Difference]: Start difference. First operand 740 states and 946 transitions. Second operand 12 states. [2020-07-21 12:14:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:14:33,229 INFO L93 Difference]: Finished difference Result 3037 states and 4796 transitions. [2020-07-21 12:14:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-21 12:14:33,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2020-07-21 12:14:33,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:14:33,254 INFO L225 Difference]: With dead ends: 3037 [2020-07-21 12:14:33,254 INFO L226 Difference]: Without dead ends: 3034 [2020-07-21 12:14:33,257 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2020-07-21 12:14:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2020-07-21 12:14:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 2858. [2020-07-21 12:14:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2858 states. [2020-07-21 12:14:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 4422 transitions. [2020-07-21 12:14:33,554 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 4422 transitions. Word has length 99 [2020-07-21 12:14:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:14:33,554 INFO L479 AbstractCegarLoop]: Abstraction has 2858 states and 4422 transitions. [2020-07-21 12:14:33,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 12:14:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 4422 transitions. [2020-07-21 12:14:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-21 12:14:33,561 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:14:33,561 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 12:14:33,774 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:33,775 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:14:33,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:14:33,775 INFO L82 PathProgramCache]: Analyzing trace with hash -94268667, now seen corresponding path program 2 times [2020-07-21 12:14:33,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:14:33,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [151992454] [2020-07-21 12:14:33,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:14:33,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 12:14:33,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:14:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-21 12:14:33,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:14:33,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [151992454] [2020-07-21 12:14:33,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:14:33,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:14:33,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491774820] [2020-07-21 12:14:33,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:14:33,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:14:33,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:14:33,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:33,912 INFO L87 Difference]: Start difference. First operand 2858 states and 4422 transitions. Second operand 3 states. [2020-07-21 12:14:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:14:34,051 INFO L93 Difference]: Finished difference Result 4365 states and 7127 transitions. [2020-07-21 12:14:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:14:34,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2020-07-21 12:14:34,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:14:34,068 INFO L225 Difference]: With dead ends: 4365 [2020-07-21 12:14:34,069 INFO L226 Difference]: Without dead ends: 2220 [2020-07-21 12:14:34,114 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2020-07-21 12:14:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2142. [2020-07-21 12:14:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2020-07-21 12:14:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3078 transitions. [2020-07-21 12:14:34,370 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3078 transitions. Word has length 125 [2020-07-21 12:14:34,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:14:34,370 INFO L479 AbstractCegarLoop]: Abstraction has 2142 states and 3078 transitions. [2020-07-21 12:14:34,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:14:34,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3078 transitions. [2020-07-21 12:14:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-21 12:14:34,380 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 12:14:34,380 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 12:14:34,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:34,594 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 12:14:34,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 12:14:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash -762214359, now seen corresponding path program 1 times [2020-07-21 12:14:34,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 12:14:34,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1015468002] [2020-07-21 12:14:34,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-21 12:14:34,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 12:14:34,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 12:14:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-21 12:14:34,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 12:14:34,770 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1015468002] [2020-07-21 12:14:34,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 12:14:34,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 12:14:34,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591736133] [2020-07-21 12:14:34,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 12:14:34,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 12:14:34,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 12:14:34,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:34,772 INFO L87 Difference]: Start difference. First operand 2142 states and 3078 transitions. Second operand 3 states. [2020-07-21 12:14:34,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 12:14:34,845 INFO L93 Difference]: Finished difference Result 2710 states and 3907 transitions. [2020-07-21 12:14:34,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 12:14:34,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-07-21 12:14:34,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 12:14:34,847 INFO L225 Difference]: With dead ends: 2710 [2020-07-21 12:14:34,847 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 12:14:34,863 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 12:14:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 12:14:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 12:14:34,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 12:14:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 12:14:34,865 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2020-07-21 12:14:34,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 12:14:34,865 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 12:14:34,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 12:14:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 12:14:34,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 12:14:35,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 12:14:35,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 12:14:37,612 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2020-07-21 12:14:37,852 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2020-07-21 12:14:38,025 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-07-21 12:14:38,364 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2020-07-21 12:14:38,733 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-07-21 12:14:39,084 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 53 [2020-07-21 12:14:39,422 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2020-07-21 12:14:39,643 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2020-07-21 12:14:41,003 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2020-07-21 12:14:41,311 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-07-21 12:14:41,676 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-07-21 12:14:41,844 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 44 [2020-07-21 12:14:42,779 WARN L193 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2020-07-21 12:14:43,413 WARN L193 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 92 [2020-07-21 12:14:43,878 WARN L193 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2020-07-21 12:14:44,323 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2020-07-21 12:14:44,427 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-07-21 12:14:44,911 WARN L193 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2020-07-21 12:14:46,046 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2020-07-21 12:14:46,245 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-07-21 12:14:46,550 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2020-07-21 12:14:47,280 WARN L193 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 79 [2020-07-21 12:14:47,606 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2020-07-21 12:14:47,911 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2020-07-21 12:14:47,916 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2020-07-21 12:14:47,917 INFO L268 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2020-07-21 12:14:47,917 INFO L268 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2020-07-21 12:14:47,917 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2020-07-21 12:14:47,918 INFO L264 CegarLoopResult]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse4 (not (= 1 ~q_free~0)))) (and (or .cse0 .cse1 (not (<= 1 ~c_dr_pc~0)) .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) .cse3 .cse4 (not (<= 2 ~c_dr_st~0))) (or (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) (not (<= ~c_dr_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 ~p_num_write~0)) (not (= ~c_last_read~0 ~p_last_write~0))))) [2020-07-21 12:14:47,918 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2020-07-21 12:14:47,918 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2020-07-21 12:14:47,919 INFO L268 CegarLoopResult]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2020-07-21 12:14:47,919 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) (not (<= ~c_dr_pc~0 0)) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 ~p_dw_i~0)) (= 0 ~p_dw_st~0) (not (= 1 ~q_free~0)) (not (= 0 ~p_num_write~0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-07-21 12:14:47,919 INFO L268 CegarLoopResult]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2020-07-21 12:14:47,919 INFO L264 CegarLoopResult]: At program point L354-1(line 354) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 1 ~p_dw_i~0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-21 12:14:47,920 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-21 12:14:47,920 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2020-07-21 12:14:47,920 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2020-07-21 12:14:47,920 INFO L268 CegarLoopResult]: For program point L355(line 355) no Hoare annotation was computed. [2020-07-21 12:14:47,920 INFO L264 CegarLoopResult]: At program point L354(line 354) the Hoare annotation is: (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-21 12:14:47,921 INFO L264 CegarLoopResult]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse3 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (not (= 1 |old(~q_free~0)|))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse0 (= 0 ~q_free~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (<= 2 ~p_dw_st~0))) (and (or (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse1 .cse2) (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse3 .cse4 (not (<= 1 ~c_dr_pc~0)) .cse5 (not (<= 2 |old(~c_dr_st~0)|))) (or (not (= 0 ~c_num_read~0)) (not (<= ~c_dr_pc~0 0)) .cse3 .cse4 (not (= 0 |old(~p_num_write~0)|)) .cse5 (not (= ~c_last_read~0 |old(~p_last_write~0)|)) (and .cse0 (= 1 ~p_num_write~0) .cse1 .cse2) (not (<= |old(~p_dw_pc~0)| 0))))) [2020-07-21 12:14:47,921 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_dr_st~0)) (.cse7 (not (<= 2 |old(~c_dr_st~0)|))) (.cse1 (not (= 0 ~c_num_read~0))) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not (= 1 |old(~q_free~0)|))) (.cse4 (not (= 0 |old(~p_num_write~0)|))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse6 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse11 (<= ~p_dw_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse2 .cse3 (not (<= 1 ~c_dr_pc~0)) .cse5 .cse7 (and .cse0 (= ~c_num_read~0 ~p_num_write~0) .cse9 .cse10)) (or .cse1 .cse2 (and .cse11 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 (not (<= ~c_dr_pc~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse11 .cse12 (= 0 ~p_num_write~0) .cse9 .cse10) .cse8))) [2020-07-21 12:14:47,921 INFO L264 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse0 (not (= 0 ~c_num_read~0))) (.cse4 (<= ~p_dw_pc~0 0)) (.cse6 (not (= 0 |old(~p_num_write~0)|))) (.cse8 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse9 (not (<= |old(~p_dw_pc~0)| 0))) (.cse10 (<= 2 ~c_dr_st~0)) (.cse3 (= 0 ~q_free~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse7 (not (= 1 ~p_dw_i~0))) (.cse11 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 (not (<= ~c_dr_pc~0 0)) .cse1 .cse2 (and .cse3 .cse4 (= 1 ~p_num_write~0) .cse5) .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse2 .cse6 .cse7 .cse8 .cse11 .cse9) (or .cse0 .cse1 .cse4 .cse2 .cse6 .cse7 .cse8 .cse11 .cse9) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (and .cse10 .cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5) .cse1 .cse2 (not (<= 1 ~c_dr_pc~0)) .cse7 .cse11))) [2020-07-21 12:14:47,921 INFO L268 CegarLoopResult]: For program point L124-1(line 124) no Hoare annotation was computed. [2020-07-21 12:14:47,922 INFO L268 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2020-07-21 12:14:47,922 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2020-07-21 12:14:47,922 INFO L264 CegarLoopResult]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse4 (<= 2 ~c_dr_st~0)) (.cse3 (not (<= 2 |old(~c_dr_st~0)|))) (.cse6 (not (= 0 ~c_num_read~0))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse7 (not (= 0 |old(~p_num_write~0)|))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse8 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse10 (<= ~p_dw_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse0 .cse1 (not (<= 1 ~c_dr_pc~0)) .cse2 .cse3 (and .cse4 (= ~c_num_read~0 ~p_num_write~0) .cse5)) (or .cse6 .cse4 .cse0 .cse1 .cse7 .cse2 .cse8 .cse3 .cse9) (or .cse6 .cse0 .cse10 .cse1 .cse7 .cse2 .cse8 .cse3 .cse9) (or .cse6 (not (<= ~c_dr_pc~0 0)) .cse0 .cse1 .cse7 .cse2 .cse8 (and .cse10 (= 0 ~p_num_write~0) .cse5) .cse9))) [2020-07-21 12:14:47,922 INFO L264 CegarLoopResult]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse13 (= 0 ~q_free~0)) (.cse7 (<= ~p_dw_pc~0 0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse0 (not (= 0 ~c_num_read~0))) (.cse3 (and .cse13 .cse7 (= 1 ~p_num_write~0) .cse9)) (.cse4 (not (= 0 |old(~p_num_write~0)|))) (.cse6 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse10 (not (<= |old(~p_dw_pc~0)| 0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse11 (not (<= 2 |old(~c_dr_st~0)|))) (.cse12 (<= 2 ~c_dr_st~0)) (.cse8 (= 1 ~q_free~0))) (and (or .cse0 (not (<= ~c_dr_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0) .cse8 .cse9) .cse10) (or .cse0 .cse1 .cse7 .cse2 .cse4 .cse5 .cse6 .cse11 .cse10) (or .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse10) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse1 .cse2 (not (<= 1 ~c_dr_pc~0)) .cse5 (and .cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse9) .cse11 (and .cse12 (= ~c_num_read~0 ~p_num_write~0) .cse8 .cse9))))) [2020-07-21 12:14:47,922 INFO L268 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2020-07-21 12:14:47,923 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-07-21 12:14:47,923 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-21 12:14:47,923 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-07-21 12:14:47,923 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-07-21 12:14:47,923 INFO L264 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse7 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (not (= 1 ~q_free~0))) (.cse4 (not (= 1 ~p_num_write~0))) (.cse9 (<= 2 ~p_dw_st~0)) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (<= 2 ~c_dr_st~0)) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (<= 1 ~c_dr_pc~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 |old(~c_dr_st~0)|))) (.cse5 (not (= 0 ~q_free~0)))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 ~c_num_read~0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse6 .cse7 .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) .cse8 .cse9 .cse10) (or .cse1 .cse7 .cse2 .cse8 .cse4 .cse9 (not (= 1 ~c_num_read~0)) .cse10) (or .cse0 .cse1 .cse6 .cse2 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse3 .cse5))) [2020-07-21 12:14:47,924 INFO L268 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2020-07-21 12:14:47,924 INFO L268 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-07-21 12:14:47,924 INFO L268 CegarLoopResult]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2020-07-21 12:14:47,924 INFO L268 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2020-07-21 12:14:47,924 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2020-07-21 12:14:47,924 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse7 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (not (= 1 ~q_free~0))) (.cse4 (not (= 1 ~p_num_write~0))) (.cse9 (<= 2 ~p_dw_st~0)) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (<= 2 ~c_dr_st~0)) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (<= 1 ~c_dr_pc~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 |old(~c_dr_st~0)|))) (.cse5 (not (= 0 ~q_free~0)))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 ~c_num_read~0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse6 .cse7 .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) .cse8 .cse9 .cse10) (or .cse1 .cse7 .cse2 .cse8 .cse4 .cse9 (not (= 1 ~c_num_read~0)) .cse10) (or .cse0 .cse1 .cse6 .cse2 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse3 .cse5))) [2020-07-21 12:14:47,925 INFO L264 CegarLoopResult]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse5 (not (= 1 ~p_num_write~0))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (= 0 ~p_dw_st~0)) (.cse4 (not (= 1 ~q_free~0))) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse8 (<= 2 ~c_dr_st~0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (<= 1 ~c_dr_pc~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse9 (not (<= 2 |old(~c_dr_st~0)|))) (.cse10 (not (= 0 ~q_free~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 1 ~c_num_read~0)) .cse7) (or (not (<= ~p_dw_pc~0 0)) .cse8 (not (= 0 ~c_num_read~0)) .cse0 .cse2 .cse9 .cse5 .cse10) (or .cse0 .cse11 .cse1 .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) .cse3 .cse4 .cse6 .cse7) (or .cse8 .cse0 .cse11 .cse2 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse9 .cse10))) [2020-07-21 12:14:47,925 INFO L268 CegarLoopResult]: For program point L72-1(line 72) no Hoare annotation was computed. [2020-07-21 12:14:47,925 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-21 12:14:47,925 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (= ~c_num_read~0 ~p_num_write~0)) [2020-07-21 12:14:47,925 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-21 12:14:47,926 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse2 (not (= 0 |old(~p_dw_st~0)|))) (.cse4 (not (= 0 |old(~p_num_write~0)|))) (.cse9 (not (<= |old(~p_dw_pc~0)| 0))) (.cse10 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse7 (not (<= |old(~c_dr_pc~0)| 0))) (.cse11 (= 0 ~c_num_read~0)) (.cse12 (<= ~c_dr_pc~0 0)) (.cse13 (= 1 ~q_free~0)) (.cse3 (not (= 1 |old(~q_free~0)|))) (.cse0 (<= 2 ~c_dr_st~0)) (.cse8 (not (<= 2 |old(~c_dr_st~0)|))) (.cse19 (not (= 1 |old(~p_num_write~0)|))) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse20 (= 1 ~p_num_write~0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse15 (not (<= 2 |old(~p_dw_st~0)|))) (.cse16 (not (= 0 |old(~q_free~0)|))) (.cse21 (= 0 ~q_free~0)) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (<= 2 ~p_dw_st~0)) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse17 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse18 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (and (<= ~p_dw_pc~0 0) .cse11 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse12 (= 0 ~p_num_write~0) .cse13 .cse14) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (or .cse0 .cse1 .cse15 .cse16 .cse5 .cse17 .cse8 .cse18) (or .cse1 .cse19 .cse3 .cse15 .cse5 .cse17 (not (= 1 |old(~c_num_read~0)|)) .cse8 .cse20) (or .cse1 .cse19 .cse15 .cse16 .cse5 .cse6 .cse7 (and .cse21 .cse11 .cse12 .cse14 .cse22)) (or (and .cse0 (= ~c_num_read~0 ~p_num_write~0) .cse23 .cse13 .cse14 .cse22) .cse1 .cse3 .cse15 .cse5 .cse17 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse8) (or .cse0 .cse1 .cse19 .cse15 .cse16 .cse5 .cse6 .cse8) (or .cse1 .cse19 .cse15 .cse16 .cse5 .cse6 .cse20) (or .cse1 .cse15 .cse16 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse21 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse23 .cse14 .cse22) .cse5 .cse17 .cse18))) [2020-07-21 12:14:47,926 INFO L264 CegarLoopResult]: At program point L254(line 254) the Hoare annotation is: (let ((.cse16 (<= 2 ~c_dr_st~0)) (.cse19 (= 1 ~p_dw_i~0)) (.cse2 (= 1 ~q_free~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse4 (not (= 0 |old(~p_dw_st~0)|))) (.cse6 (not (= 0 |old(~p_num_write~0)|))) (.cse9 (not (<= |old(~c_dr_pc~0)| 0))) (.cse10 (not (<= |old(~p_dw_pc~0)| 0))) (.cse11 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse18 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse0 (and .cse16 .cse19 (= ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse2 .cse3)) (.cse12 (not (= 1 |old(~p_num_write~0)|))) (.cse14 (not (= 0 |old(~q_free~0)|))) (.cse8 (not (= 0 |old(~c_num_read~0)|))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse5 (not (= 1 |old(~q_free~0)|))) (.cse13 (not (<= 2 |old(~p_dw_st~0)|))) (.cse7 (not .cse19)) (.cse17 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse15 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (<= 1 eval_~tmp___1~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse12 .cse13 .cse14 .cse7 .cse8 .cse15) (or .cse16 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15 .cse10 .cse11) (or .cse1 .cse13 .cse14 .cse7 .cse17 .cse15 .cse18) (or .cse0 .cse1 .cse13 .cse14 .cse7 .cse17 .cse18) (or .cse0 .cse1 .cse12 .cse13 .cse14 .cse7 .cse8) (or .cse1 .cse5 .cse13 .cse7 .cse17 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse15)))) [2020-07-21 12:14:47,926 INFO L268 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2020-07-21 12:14:47,926 INFO L268 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2020-07-21 12:14:47,927 INFO L268 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-07-21 12:14:47,927 INFO L264 CegarLoopResult]: At program point L238(line 238) the Hoare annotation is: (let ((.cse28 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse17 (<= 2 ~c_dr_st~0)) (.cse23 (= 0 ~p_dw_st~0)) (.cse30 (= ~c_num_read~0 ~p_num_write~0)) (.cse31 (<= 1 ~c_dr_pc~0)) (.cse25 (= 1 ~q_free~0)) (.cse7 (= 0 ~q_free~0)) (.cse29 (= 1 ~p_dw_i~0)) (.cse8 (= 0 ~c_num_read~0)) (.cse24 (<= ~c_dr_pc~0 0)) (.cse9 (= 1 ~p_num_write~0)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (<= 2 ~p_dw_st~0))) (let ((.cse14 (not (= 0 |old(~p_dw_st~0)|))) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (not (<= |old(~p_dw_pc~0)| 0))) (.cse19 (and .cse7 .cse29 .cse8 (= ~p_num_write~0 (+ |old(~p_num_write~0)| 1)) .cse24 .cse9 .cse10 .cse11)) (.cse22 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse4 (and .cse17 .cse29 .cse23 .cse30 .cse31 .cse25 .cse10)) (.cse13 (and .cse7 .cse28 .cse31 .cse10 .cse11)) (.cse27 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse0 (and .cse17 .cse29 .cse30 .cse31 .cse25 .cse10 .cse11)) (.cse20 (not (<= |old(~c_dr_pc~0)| 0))) (.cse18 (not (= 1 |old(~q_free~0)|))) (.cse26 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~p_num_write~0)|))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse6 (not .cse29)) (.cse12 (not (= 0 |old(~c_num_read~0)|))) (.cse21 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13) (or .cse1 .cse14 .cse15 .cse16 .cse13 .cse17 .cse18 .cse19 .cse6 .cse12 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse14 .cse15 .cse16 .cse13 (and (<= ~p_dw_pc~0 0) .cse8 (= ~c_last_read~0 ~p_last_write~0) .cse23 .cse24 (= 0 ~p_num_write~0) .cse25 .cse10) .cse18 .cse19 .cse4 .cse6 .cse12 .cse20 .cse22) (or .cse0 .cse1 .cse4 .cse5 .cse3 .cse6 .cse26 .cse13 .cse27) (or .cse1 .cse5 .cse3 .cse6 .cse26 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse17 .cse28) .cse21 .cse27) (or .cse0 .cse1 .cse18 .cse5 .cse6 .cse26 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse21) (or .cse1 .cse2 .cse5 .cse3 .cse6 (and .cse17 .cse24) .cse12 .cse20 .cse21) (or .cse1 .cse2 .cse18 .cse5 .cse6 .cse26 (not (= 1 |old(~c_num_read~0)|)) .cse21 .cse9) (or .cse1 .cse2 .cse5 .cse3 .cse6 .cse12 .cse21 .cse9)))) [2020-07-21 12:14:47,928 INFO L264 CegarLoopResult]: At program point L269(line 269) the Hoare annotation is: (let ((.cse15 (= 0 ~q_free~0)) (.cse23 (= 1 ~p_dw_i~0)) (.cse16 (= 0 ~c_num_read~0)) (.cse22 (<= ~c_dr_pc~0 0)) (.cse17 (= 1 ~p_num_write~0)) (.cse18 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (<= 2 ~p_dw_st~0))) (let ((.cse1 (not (= 1 |old(~p_num_write~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse21 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse7 (not (= 0 |old(~p_dw_st~0)|))) (.cse9 (and .cse15 .cse23 .cse16 (= ~p_num_write~0 (+ |old(~p_num_write~0)| 1)) .cse22 .cse17 .cse18 .cse19)) (.cse10 (not (= 0 |old(~p_num_write~0)|))) (.cse5 (not (= 0 |old(~c_num_read~0)|))) (.cse11 (not (<= |old(~c_dr_pc~0)| 0))) (.cse12 (not (<= |old(~p_dw_pc~0)| 0))) (.cse13 (and .cse15 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse18 .cse19)) (.cse14 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse8 (not (= 1 |old(~q_free~0)|))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not .cse23)) (.cse20 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse6 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse9 .cse10 .cse4 .cse5 .cse11 .cse6 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse15 .cse16 .cse17 .cse18 .cse19) .cse5 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse20 .cse6 .cse21) (or .cse0 .cse2 .cse3 .cse4 .cse20 .cse13 .cse21) (or .cse0 .cse7 .cse8 .cse9 .cse10 .cse4 (and (<= ~p_dw_pc~0 0) .cse16 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= 1 eval_~tmp___1~0) .cse22 (= 0 ~p_num_write~0) (= 1 ~q_free~0) .cse18) .cse5 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse8 .cse2 .cse4 .cse20 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse6)))) [2020-07-21 12:14:47,928 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2020-07-21 12:14:47,928 INFO L268 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2020-07-21 12:14:47,928 INFO L268 CegarLoopResult]: For program point L247(lines 237 277) no Hoare annotation was computed. [2020-07-21 12:14:47,928 INFO L264 CegarLoopResult]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse12 (<= 2 ~c_dr_st~0)) (.cse21 (= 1 ~p_dw_i~0)) (.cse18 (<= 1 ~c_dr_pc~0)) (.cse17 (= 0 ~q_free~0)) (.cse16 (= 1 ~p_num_write~0)) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (<= 2 ~p_dw_st~0))) (let ((.cse7 (and .cse17 (= 0 ~c_num_read~0) .cse16 .cse19 .cse20)) (.cse10 (not (<= |old(~c_dr_pc~0)| 0))) (.cse9 (not (= 1 |old(~q_free~0)|))) (.cse2 (not (= 1 |old(~p_num_write~0)|))) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse14 (not (<= 2 |old(~c_dr_st~0)|))) (.cse0 (and .cse12 .cse21 (= ~c_num_read~0 ~p_num_write~0) .cse18 (= 1 ~q_free~0) .cse19 .cse20)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not (= 0 |old(~q_free~0)|))) (.cse5 (not .cse21)) (.cse11 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse8 (and .cse17 .cse13 .cse18 .cse19 .cse20)) (.cse15 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 (not (= 0 |old(~p_dw_st~0)|)) .cse9 (not (= 0 |old(~p_num_write~0)|)) .cse5 .cse6 .cse7 .cse10 (not (<= |old(~p_dw_pc~0)| 0)) .cse8 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse1 .cse3 .cse4 .cse5 .cse11 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse12 .cse13) .cse14 .cse15) (or .cse0 .cse1 .cse9 .cse3 .cse5 .cse11 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse14) (or .cse1 .cse2 .cse3 .cse4 (and .cse12 (<= ~c_dr_pc~0 0)) .cse5 .cse6 .cse10 .cse14) (or .cse1 .cse2 .cse9 .cse3 .cse5 .cse11 (not (= 1 |old(~c_num_read~0)|)) .cse14 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse16) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse8 .cse15)))) [2020-07-21 12:14:47,929 INFO L268 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2020-07-21 12:14:47,929 INFO L264 CegarLoopResult]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse28 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse17 (<= 2 ~c_dr_st~0)) (.cse23 (= 0 ~p_dw_st~0)) (.cse30 (= ~c_num_read~0 ~p_num_write~0)) (.cse31 (<= 1 ~c_dr_pc~0)) (.cse25 (= 1 ~q_free~0)) (.cse7 (= 0 ~q_free~0)) (.cse29 (= 1 ~p_dw_i~0)) (.cse8 (= 0 ~c_num_read~0)) (.cse24 (<= ~c_dr_pc~0 0)) (.cse9 (= 1 ~p_num_write~0)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (<= 2 ~p_dw_st~0))) (let ((.cse14 (not (= 0 |old(~p_dw_st~0)|))) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse16 (not (<= |old(~p_dw_pc~0)| 0))) (.cse19 (and .cse7 .cse29 .cse8 (= ~p_num_write~0 (+ |old(~p_num_write~0)| 1)) .cse24 .cse9 .cse10 .cse11)) (.cse22 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse4 (and .cse17 .cse29 .cse23 .cse30 .cse31 .cse25 .cse10)) (.cse13 (and .cse7 .cse28 .cse31 .cse10 .cse11)) (.cse27 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse0 (and .cse17 .cse29 .cse30 .cse31 .cse25 .cse10 .cse11)) (.cse20 (not (<= |old(~c_dr_pc~0)| 0))) (.cse18 (not (= 1 |old(~q_free~0)|))) (.cse26 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~p_num_write~0)|))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse6 (not .cse29)) (.cse12 (not (= 0 |old(~c_num_read~0)|))) (.cse21 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13) (or .cse1 .cse14 .cse15 .cse16 .cse13 .cse17 .cse18 .cse19 .cse6 .cse12 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse14 .cse15 .cse16 .cse13 (and (<= ~p_dw_pc~0 0) .cse8 (= ~c_last_read~0 ~p_last_write~0) .cse23 .cse24 (= 0 ~p_num_write~0) .cse25 .cse10) .cse18 .cse19 .cse4 .cse6 .cse12 .cse20 .cse22) (or .cse0 .cse1 .cse4 .cse5 .cse3 .cse6 .cse26 .cse13 .cse27) (or .cse1 .cse5 .cse3 .cse6 .cse26 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse17 .cse28) .cse21 .cse27) (or .cse0 .cse1 .cse18 .cse5 .cse6 .cse26 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|)) .cse21) (or .cse1 .cse2 .cse5 .cse3 .cse6 (and .cse17 .cse24) .cse12 .cse20 .cse21) (or .cse1 .cse2 .cse18 .cse5 .cse6 .cse26 (not (= 1 |old(~c_num_read~0)|)) .cse21 .cse9) (or .cse1 .cse2 .cse5 .cse3 .cse6 .cse12 .cse21 .cse9)))) [2020-07-21 12:14:47,929 INFO L268 CegarLoopResult]: For program point L290-1(line 290) no Hoare annotation was computed. [2020-07-21 12:14:47,929 INFO L271 CegarLoopResult]: At program point L299(lines 288 301) the Hoare annotation is: true [2020-07-21 12:14:47,929 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2020-07-21 12:14:47,930 INFO L268 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2020-07-21 12:14:47,930 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2020-07-21 12:14:47,930 INFO L271 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: true [2020-07-21 12:14:47,930 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2020-07-21 12:14:47,930 INFO L271 CegarLoopResult]: At program point L62(lines 50 64) the Hoare annotation is: true [2020-07-21 12:14:47,930 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2020-07-21 12:14:47,930 INFO L268 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2020-07-21 12:14:47,930 INFO L268 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2020-07-21 12:14:47,931 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2020-07-21 12:14:47,931 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2020-07-21 12:14:47,931 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2020-07-21 12:14:47,931 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-21 12:14:47,931 INFO L268 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2020-07-21 12:14:47,931 INFO L268 CegarLoopResult]: For program point L318(line 318) no Hoare annotation was computed. [2020-07-21 12:14:47,932 INFO L264 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse0 (= 0 ~q_free~0)) (.cse1 (= 0 ~c_num_read~0)) (.cse4 (<= 1 ~c_dr_pc~0)) (.cse5 (= 1 ~q_free~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~p_dw_st~0))) (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse1 (= 1 ~p_num_write~0) .cse2 .cse3) (not (<= |old(~p_dw_pc~0)| 0)) (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse4 .cse2 .cse3) (and (<= ~p_dw_pc~0 0) .cse1 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) .cse5 .cse2) (and (<= 2 ~c_dr_st~0) (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 .cse2 .cse3) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-21 12:14:47,932 INFO L264 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse3 (= 0 ~q_free~0)) (.cse0 (<= 1 ~c_dr_pc~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (and (<= 2 ~c_dr_st~0) (= ~c_num_read~0 ~p_num_write~0) .cse0 (= 1 ~q_free~0) .cse1 .cse2) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (and .cse3 (= 0 ~c_num_read~0) (= 1 ~p_num_write~0) .cse1 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= |old(~p_dw_pc~0)| 0)) (and .cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse0 .cse1 .cse2) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-21 12:14:47,932 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2020-07-21 12:14:47,932 INFO L268 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2020-07-21 12:14:47,933 INFO L264 CegarLoopResult]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse0 (= 0 ~q_free~0)) (.cse1 (= 0 ~c_num_read~0)) (.cse4 (<= 1 ~c_dr_pc~0)) (.cse5 (= 1 ~q_free~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~p_dw_st~0))) (or (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse0 .cse1 (= 1 ~p_num_write~0) .cse2 .cse3) (not (<= |old(~p_dw_pc~0)| 0)) (and .cse0 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse4 .cse2 .cse3) (and (<= ~p_dw_pc~0 0) .cse1 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) .cse5 .cse2) (and (<= 2 ~c_dr_st~0) (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 .cse2 .cse3) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-21 12:14:47,933 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (or (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-21 12:14:47,933 INFO L271 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2020-07-21 12:14:47,933 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-21 12:14:47,933 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0)) [2020-07-21 12:14:47,933 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-21 12:14:47,933 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-21 12:14:47,934 INFO L268 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2020-07-21 12:14:47,934 INFO L268 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2020-07-21 12:14:47,934 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2020-07-21 12:14:47,934 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2020-07-21 12:14:47,934 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2020-07-21 12:14:47,934 INFO L271 CegarLoopResult]: At program point L43(lines 31 45) the Hoare annotation is: true [2020-07-21 12:14:47,934 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2020-07-21 12:14:47,934 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2020-07-21 12:14:47,935 INFO L264 CegarLoopResult]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (<= 2 |old(~p_dw_st~0)|))) (.cse9 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (= 0 |old(~c_num_read~0)|))) (.cse11 (<= 2 ~p_dw_st~0)) (.cse3 (<= 2 ~c_dr_st~0)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= 0 ~p_dw_st~0)) (.cse6 (<= 1 ~c_dr_pc~0)) (.cse7 (= 1 ~q_free~0))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse1 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse2 (not (<= |old(~c_dr_pc~0)| 0)) (and .cse3 (= 0 ~c_num_read~0) .cse4 .cse5 .cse6 .cse7) (not (= 0 ~p_num_write~0))) (let ((.cse10 (= ~c_num_read~0 ~p_num_write~0))) (or .cse0 .cse8 .cse9 .cse1 (not (<= 1 |old(~c_dr_pc~0)|)) (and .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse3 .cse10 .cse6 .cse7 .cse11) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))))) (let ((.cse12 (= 1 ~c_num_read~0))) (or .cse0 .cse8 .cse9 .cse1 .cse2 (and .cse12 .cse3 .cse6 .cse7 .cse11) (not (= 1 ~p_num_write~0)) (and .cse12 .cse3 .cse4 .cse5 .cse6 .cse7))))) [2020-07-21 12:14:47,935 INFO L268 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2020-07-21 12:14:47,935 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0))) (or .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))))) [2020-07-21 12:14:47,936 INFO L264 CegarLoopResult]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse13 (= 1 ~p_dw_i~0))) (let ((.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse1 (= 0 ~c_num_read~0)) (.cse7 (not (<= |old(~c_dr_pc~0)| 0))) (.cse12 (= 0 ~q_free~0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (<= 2 |old(~p_dw_st~0)|))) (.cse11 (not (= 0 |old(~q_free~0)|))) (.cse5 (not .cse13)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse4 (= 1 ~q_free~0))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (and .cse1 .cse2 .cse3 .cse4) .cse5 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse6 .cse7 (not (= 0 ~p_num_write~0))) (let ((.cse8 (= 1 ~c_num_read~0))) (or (and .cse8 .cse2 .cse4 .cse9) .cse0 .cse10 .cse11 .cse5 .cse6 (and .cse12 .cse1 (<= ~c_dr_pc~0 0) .cse9) (and .cse8 .cse13 .cse2 .cse3 .cse4) .cse7 (not (= 1 ~p_num_write~0)))) (let ((.cse14 (= ~c_num_read~0 ~p_num_write~0))) (or (and .cse12 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse9) .cse0 .cse10 .cse11 .cse5 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) (and .cse2 .cse14 .cse4 .cse9) (and .cse13 .cse2 .cse3 .cse14 .cse4)))))) [2020-07-21 12:14:47,936 INFO L264 CegarLoopResult]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (not (<= |old(~c_dr_pc~0)| 0)))) (and (or (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) (<= 2 ~p_dw_st~0)) .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 .cse5 (not (= 0 ~p_num_write~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 1 ~p_num_write~0))))) [2020-07-21 12:14:47,936 INFO L268 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2020-07-21 12:14:47,936 INFO L268 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2020-07-21 12:14:47,936 INFO L264 CegarLoopResult]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (<= 2 |old(~p_dw_st~0)|))) (.cse9 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (= 0 |old(~c_num_read~0)|))) (.cse6 (= 0 ~q_free~0)) (.cse4 (= 0 ~c_num_read~0)) (.cse5 (<= ~c_dr_pc~0 0)) (.cse7 (<= 2 ~p_dw_st~0)) (.cse3 (not (<= |old(~c_dr_pc~0)| 0)))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse1 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse2 .cse3 (and .cse4 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse5 (= 1 ~q_free~0)) (not (= 0 ~p_num_write~0))) (or (and .cse6 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse7) .cse0 .cse8 .cse9 .cse1 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or .cse0 .cse8 .cse9 .cse1 .cse2 (and .cse6 .cse4 .cse5 .cse7) .cse3 (not (= 1 ~p_num_write~0))))) [2020-07-21 12:14:47,936 INFO L268 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2020-07-21 12:14:47,937 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0))) (or .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))))) [2020-07-21 12:14:47,937 INFO L268 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2020-07-21 12:14:47,937 INFO L268 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2020-07-21 12:14:47,937 INFO L264 CegarLoopResult]: At program point L169(line 169) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 1 ~q_free~0)) (.cse8 (<= 2 ~p_dw_st~0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (not (<= |old(~c_dr_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 1 ~p_num_write~0)) (and (= 1 ~c_num_read~0) .cse6 (<= ~c_dr_pc~0 0) .cse7 .cse8)) (or .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (and .cse6 (= ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse7 .cse8) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 .cse5 (not (= 0 ~p_num_write~0))))) [2020-07-21 12:14:47,937 INFO L268 CegarLoopResult]: For program point L169-1(line 169) no Hoare annotation was computed. [2020-07-21 12:14:47,937 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2020-07-21 12:14:47,937 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2020-07-21 12:14:47,938 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 ~p_dw_st~0)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-07-21 12:14:47,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 12:14:47 BoogieIcfgContainer [2020-07-21 12:14:47,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 12:14:47,991 INFO L168 Benchmark]: Toolchain (without parser) took 23638.74 ms. Allocated memory was 138.9 MB in the beginning and 569.4 MB in the end (delta: 430.4 MB). Free memory was 98.6 MB in the beginning and 414.5 MB in the end (delta: -315.9 MB). Peak memory consumption was 411.6 MB. Max. memory is 7.1 GB. [2020-07-21 12:14:47,991 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory was 117.1 MB in the beginning and 116.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-21 12:14:47,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.71 ms. Allocated memory is still 138.9 MB. Free memory was 98.2 MB in the beginning and 85.8 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-07-21 12:14:47,993 INFO L168 Benchmark]: Boogie Preprocessor took 177.04 ms. Allocated memory was 138.9 MB in the beginning and 199.8 MB in the end (delta: 60.8 MB). Free memory was 85.8 MB in the beginning and 177.7 MB in the end (delta: -91.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-21 12:14:47,993 INFO L168 Benchmark]: RCFGBuilder took 619.79 ms. Allocated memory is still 199.8 MB. Free memory was 177.7 MB in the beginning and 150.8 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2020-07-21 12:14:47,994 INFO L168 Benchmark]: TraceAbstraction took 22538.10 ms. Allocated memory was 199.8 MB in the beginning and 569.4 MB in the end (delta: 369.6 MB). Free memory was 150.1 MB in the beginning and 414.5 MB in the end (delta: -264.4 MB). Peak memory consumption was 402.3 MB. Max. memory is 7.1 GB. [2020-07-21 12:14:47,997 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.18 ms. Allocated memory is still 138.9 MB. Free memory was 117.1 MB in the beginning and 116.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 298.71 ms. Allocated memory is still 138.9 MB. Free memory was 98.2 MB in the beginning and 85.8 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 177.04 ms. Allocated memory was 138.9 MB in the beginning and 199.8 MB in the end (delta: 60.8 MB). Free memory was 85.8 MB in the beginning and 177.7 MB in the end (delta: -91.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 619.79 ms. Allocated memory is still 199.8 MB. Free memory was 177.7 MB in the beginning and 150.8 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22538.10 ms. Allocated memory was 199.8 MB in the beginning and 569.4 MB in the end (delta: 369.6 MB). Free memory was 150.1 MB in the beginning and 414.5 MB in the end (delta: -264.4 MB). Peak memory consumption was 402.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || ((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) && (((((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || ((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_dr_pc) <= 0)) || !(\old(p_dw_pc) <= 0)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || ((!(c_num_read == \old(p_num_write)) && 2 <= c_dr_st) && c_num_read + 1 == p_num_write)) || !(2 <= \old(c_dr_st))) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && (((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || (2 <= c_dr_st && c_dr_pc <= 0)) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && (((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_num_read) + 1 == \old(p_num_write))) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && 2 <= p_dw_st) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(p_num_write == \old(c_num_read) + 1)) && ((((((((!(p_dw_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(0 == p_num_write))) && ((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(1 == p_num_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || (((0 == q_free && p_dw_pc <= 0) && 1 == p_num_write) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || ((((p_dw_pc <= 0 && c_last_read == p_last_write) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || !(\old(p_dw_pc) <= 0)) && ((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || p_dw_pc <= 0) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && (((((((((2 <= c_dr_st || !(0 == c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || (((0 == q_free && p_dw_pc <= 0) && 1 == p_num_write) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && (((((((!(c_num_read == \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(1 <= c_dr_pc)) || !(1 == p_dw_i)) || ((0 == q_free && c_num_read + 1 == p_num_write) && p_last_write == q_buf_0)) || !(2 <= \old(c_dr_st))) || (((2 <= c_dr_st && c_num_read == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((!(p_dw_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || (((0 == c_num_read && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(0 == p_num_write)) && ((((((((((((1 == c_num_read && c_last_read == p_last_write) && 1 == q_free) && 2 <= p_dw_st) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || (((0 == q_free && 0 == c_num_read) && c_dr_pc <= 0) && 2 <= p_dw_st)) || ((((1 == c_num_read && 1 == p_dw_i) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(\old(c_dr_pc) <= 0)) || !(1 == p_num_write))) && (((((((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && 2 <= p_dw_st) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(p_num_write == \old(c_num_read) + 1)) || (((c_last_read == p_last_write && c_num_read == p_num_write) && 1 == q_free) && 2 <= p_dw_st)) || ((((1 == p_dw_i && c_last_read == p_last_write) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 == q_free)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || ((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((p_dw_pc <= 0 && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc <= 0) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || (((((2 <= c_dr_st && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(\old(c_last_read) == \old(p_last_write)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_num_write))) || !(0 == \old(q_free))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || ((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || 2 <= c_dr_st) || !(1 == \old(q_free))) || (((((((0 == q_free && 1 == p_dw_i) && 0 == c_num_read) && p_num_write == \old(p_num_write) + 1) && c_dr_pc <= 0) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st))) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((((p_dw_pc <= 0 && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc <= 0) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || !(1 == \old(q_free))) || (((((((0 == q_free && 1 == p_dw_i) && 0 == c_num_read) && p_num_write == \old(p_num_write) + 1) && c_dr_pc <= 0) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || ((!(c_num_read == \old(p_num_write)) && 2 <= c_dr_st) && c_num_read + 1 == p_num_write)) || !(2 <= \old(c_dr_st))) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && (((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || (2 <= c_dr_st && c_dr_pc <= 0)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((((((((0 == q_free && c_num_read + 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(c_num_read == \old(p_num_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(1 <= c_dr_pc)) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) && ((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || (((0 == q_free && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((!(p_dw_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || (((((2 <= c_dr_st && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free)) || !(0 == p_num_write)) && (((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || (((((2 <= c_dr_st && c_last_read == p_last_write) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free)) || ((((2 <= c_dr_st && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && 2 <= p_dw_st)) || !(p_num_write == \old(c_num_read) + 1))) && (((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || ((((1 == c_num_read && 2 <= c_dr_st) && 1 <= c_dr_pc) && 1 == q_free) && 2 <= p_dw_st)) || !(1 == p_num_write)) || (((((1 == c_num_read && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: (((((((!(p_last_write == q_buf_0) || !(0 == p_dw_st)) || !(1 <= c_dr_pc)) || !(1 == p_dw_i)) || !(c_num_read == p_num_write)) || 1 <= __retres1) || !(1 == q_free)) || !(2 <= c_dr_st)) && (((((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || 1 <= __retres1) || !(1 == q_free)) || !(0 == p_num_write)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((!(c_num_read == \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(1 <= c_dr_pc)) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || ((2 <= c_dr_st && c_num_read == p_num_write) && p_last_write == q_buf_0)) && ((((((((!(0 == c_num_read) || 2 <= c_dr_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || p_dw_pc <= 0) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || ((p_dw_pc <= 0 && 0 == p_num_write) && p_last_write == q_buf_0)) || !(\old(p_dw_pc) <= 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.5s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2059 SDtfs, 2211 SDslu, 1960 SDs, 0 SdLazy, 1467 SolverSat, 484 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1430 GetRequests, 1390 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2858occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 540 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3767 PreInvPairs, 4082 NumberOfFragments, 5689 HoareAnnotationTreeSize, 3767 FomulaSimplifications, 8365 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 45 FomulaSimplificationsInter, 11631 FormulaSimplificationTreeSizeReductionInter, 10.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1229 NumberOfCodeBlocks, 1229 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1412 ConstructedInterpolants, 0 QuantifiedInterpolants, 267368 SizeOfPredicates, 19 NumberOfNonLiveVariables, 7409 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 412/456 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 correct! Received shutdown request...