/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 SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_FUNCTIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 2 -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 14:35:43,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 14:35:43,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 14:35:43,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 14:35:43,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 14:35:43,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 14:35:43,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 14:35:43,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 14:35:43,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 14:35:43,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 14:35:43,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 14:35:43,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 14:35:43,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 14:35:43,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 14:35:43,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 14:35:43,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 14:35:43,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 14:35:43,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 14:35:43,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 14:35:43,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 14:35:43,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 14:35:43,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 14:35:43,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 14:35:43,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 14:35:43,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 14:35:43,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 14:35:43,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 14:35:43,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 14:35:43,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 14:35:43,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 14:35:43,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 14:35:43,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 14:35:43,120 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 14:35:43,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 14:35:43,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 14:35:43,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 14:35:43,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 14:35:43,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 14:35:43,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 14:35:43,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 14:35:43,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 14:35:43,128 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 14:35:43,143 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 14:35:43,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 14:35:43,145 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 14:35:43,145 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 14:35:43,145 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 14:35:43,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 14:35:43,146 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 14:35:43,146 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 14:35:43,146 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 14:35:43,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 14:35:43,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 14:35:43,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 14:35:43,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 14:35:43,147 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 14:35:43,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 14:35:43,147 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 14:35:43,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 14:35:43,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 14:35:43,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 14:35:43,148 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 14:35:43,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 14:35:43,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 14:35:43,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 14:35:43,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 14:35:43,149 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 14:35:43,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 14:35:43,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:35:43,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 14:35:43,150 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 14:35:43,150 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 -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_FUNCTIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 2 [2020-07-21 14:35:43,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 14:35:43,461 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 14:35:43,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 14:35:43,466 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 14:35:43,467 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 14:35:43,467 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 14:35:43,553 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1063102/dcd7b1977ea540a2bb29be062b997c99/FLAG15a6bc77a [2020-07-21 14:35:44,059 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 14:35:44,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-21 14:35:44,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1063102/dcd7b1977ea540a2bb29be062b997c99/FLAG15a6bc77a [2020-07-21 14:35:44,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac1063102/dcd7b1977ea540a2bb29be062b997c99 [2020-07-21 14:35:44,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 14:35:44,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 14:35:44,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 14:35:44,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 14:35:44,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 14:35:44,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:35:44" (1/1) ... [2020-07-21 14:35:44,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31392a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:35:44, skipping insertion in model container [2020-07-21 14:35:44,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:35:44" (1/1) ... [2020-07-21 14:35:44,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 14:35:44,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 14:35:44,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 14:35:44,728 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 14:35:44,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 14:35:44,781 INFO L208 MainTranslator]: Completed translation [2020-07-21 14:35:44,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:35:44 WrapperNode [2020-07-21 14:35:44,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 14:35:44,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 14:35:44,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 14:35:44,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 14:35:44,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:35:44" (1/1) ... [2020-07-21 14:35:44,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:35:44" (1/1) ... [2020-07-21 14:35:44,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:35:44" (1/1) ... [2020-07-21 14:35:44,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:35:44" (1/1) ... [2020-07-21 14:35:44,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:35:44" (1/1) ... [2020-07-21 14:35:44,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:35:44" (1/1) ... [2020-07-21 14:35:44,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:35:44" (1/1) ... [2020-07-21 14:35:44,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 14:35:44,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 14:35:44,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 14:35:44,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 14:35:44,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:35:44" (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 14:35:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 14:35:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 14:35:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-21 14:35:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-07-21 14:35:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-07-21 14:35:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-07-21 14:35:45,000 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-07-21 14:35:45,000 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-07-21 14:35:45,000 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-21 14:35:45,000 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-21 14:35:45,000 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-21 14:35:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-21 14:35:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-21 14:35:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-21 14:35:45,001 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 14:35:45,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 14:35:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 14:35:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-21 14:35:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-07-21 14:35:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-07-21 14:35:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-07-21 14:35:45,002 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-07-21 14:35:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-07-21 14:35:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-21 14:35:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-21 14:35:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-21 14:35:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-21 14:35:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-21 14:35:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-21 14:35:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 14:35:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 14:35:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 14:35:45,424 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 14:35:45,425 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-21 14:35:45,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:35:45 BoogieIcfgContainer [2020-07-21 14:35:45,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 14:35:45,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 14:35:45,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 14:35:45,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 14:35:45,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:35:44" (1/3) ... [2020-07-21 14:35:45,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a9471b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:35:45, skipping insertion in model container [2020-07-21 14:35:45,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:35:44" (2/3) ... [2020-07-21 14:35:45,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a9471b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:35:45, skipping insertion in model container [2020-07-21 14:35:45,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:35:45" (3/3) ... [2020-07-21 14:35:45,442 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-07-21 14:35:45,453 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 14:35:45,460 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 14:35:45,471 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 14:35:45,499 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 14:35:45,499 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 14:35:45,499 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 14:35:45,500 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 14:35:45,500 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 14:35:45,500 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 14:35:45,501 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 14:35:45,501 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 14:35:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2020-07-21 14:35:45,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-21 14:35:45,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:35:45,536 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 14:35:45,537 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:35:45,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:35:45,542 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2020-07-21 14:35:45,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:35:45,550 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1228315191] [2020-07-21 14:35:45,551 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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 14:35:45,853 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 14:35:45,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:35:45,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 14:35:45,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:35:45,929 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 14:35:45,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:35:45,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1228315191] [2020-07-21 14:35:45,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:35:45,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:35:45,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801664850] [2020-07-21 14:35:45,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:35:45,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:35:45,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:35:45,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:35:45,958 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2020-07-21 14:35:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:35:46,059 INFO L93 Difference]: Finished difference Result 279 states and 395 transitions. [2020-07-21 14:35:46,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:35:46,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-21 14:35:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:35:46,079 INFO L225 Difference]: With dead ends: 279 [2020-07-21 14:35:46,079 INFO L226 Difference]: Without dead ends: 175 [2020-07-21 14:35:46,087 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 14:35:46,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-07-21 14:35:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2020-07-21 14:35:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-07-21 14:35:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2020-07-21 14:35:46,182 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 65 [2020-07-21 14:35:46,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:35:46,182 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2020-07-21 14:35:46,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:35:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2020-07-21 14:35:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 14:35:46,189 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:35:46,189 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 14:35:46,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:35:46,402 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:35:46,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:35:46,403 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2020-07-21 14:35:46,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:35:46,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1093811651] [2020-07-21 14:35:46,405 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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 14:35:46,553 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:35:46,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:35:46,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 14:35:46,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:35:46,595 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 14:35:46,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:35:46,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1093811651] [2020-07-21 14:35:46,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:35:46,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:35:46,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306415110] [2020-07-21 14:35:46,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:35:46,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:35:46,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:35:46,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:35:46,603 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 3 states. [2020-07-21 14:35:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:35:46,679 INFO L93 Difference]: Finished difference Result 465 states and 642 transitions. [2020-07-21 14:35:46,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:35:46,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-21 14:35:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:35:46,686 INFO L225 Difference]: With dead ends: 465 [2020-07-21 14:35:46,686 INFO L226 Difference]: Without dead ends: 314 [2020-07-21 14:35:46,690 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 14:35:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-07-21 14:35:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2020-07-21 14:35:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-07-21 14:35:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 412 transitions. [2020-07-21 14:35:46,739 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 412 transitions. Word has length 66 [2020-07-21 14:35:46,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:35:46,739 INFO L479 AbstractCegarLoop]: Abstraction has 310 states and 412 transitions. [2020-07-21 14:35:46,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:35:46,740 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 412 transitions. [2020-07-21 14:35:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 14:35:46,745 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:35:46,745 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 14:35:46,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:35:46,961 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:35:46,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:35:46,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1988256317, now seen corresponding path program 1 times [2020-07-21 14:35:46,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:35:46,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [229502733] [2020-07-21 14:35:46,963 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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 14:35:47,097 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:35:47,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:35:47,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 14:35:47,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:35:47,148 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 14:35:47,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:35:47,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [229502733] [2020-07-21 14:35:47,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:35:47,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:35:47,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974413730] [2020-07-21 14:35:47,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:35:47,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:35:47,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:35:47,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:35:47,152 INFO L87 Difference]: Start difference. First operand 310 states and 412 transitions. Second operand 3 states. [2020-07-21 14:35:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:35:47,221 INFO L93 Difference]: Finished difference Result 882 states and 1239 transitions. [2020-07-21 14:35:47,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:35:47,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-21 14:35:47,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:35:47,230 INFO L225 Difference]: With dead ends: 882 [2020-07-21 14:35:47,231 INFO L226 Difference]: Without dead ends: 592 [2020-07-21 14:35:47,235 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 14:35:47,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-07-21 14:35:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 588. [2020-07-21 14:35:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-07-21 14:35:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 791 transitions. [2020-07-21 14:35:47,308 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 791 transitions. Word has length 66 [2020-07-21 14:35:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:35:47,309 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 791 transitions. [2020-07-21 14:35:47,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:35:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 791 transitions. [2020-07-21 14:35:47,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 14:35:47,323 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:35:47,323 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 14:35:47,534 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:35:47,535 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:35:47,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:35:47,536 INFO L82 PathProgramCache]: Analyzing trace with hash -2101642974, now seen corresponding path program 1 times [2020-07-21 14:35:47,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:35:47,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [360102970] [2020-07-21 14:35:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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 14:35:47,653 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:35:47,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:35:47,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 14:35:47,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:35:47,706 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 14:35:47,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:35:47,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [360102970] [2020-07-21 14:35:47,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:35:47,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 14:35:47,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971111765] [2020-07-21 14:35:47,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 14:35:47,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:35:47,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 14:35:47,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 14:35:47,709 INFO L87 Difference]: Start difference. First operand 588 states and 791 transitions. Second operand 6 states. [2020-07-21 14:35:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:35:47,788 INFO L93 Difference]: Finished difference Result 1115 states and 1564 transitions. [2020-07-21 14:35:47,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 14:35:47,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-07-21 14:35:47,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:35:47,795 INFO L225 Difference]: With dead ends: 1115 [2020-07-21 14:35:47,796 INFO L226 Difference]: Without dead ends: 616 [2020-07-21 14:35:47,799 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-21 14:35:47,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2020-07-21 14:35:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 608. [2020-07-21 14:35:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2020-07-21 14:35:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 807 transitions. [2020-07-21 14:35:47,867 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 807 transitions. Word has length 66 [2020-07-21 14:35:47,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:35:47,867 INFO L479 AbstractCegarLoop]: Abstraction has 608 states and 807 transitions. [2020-07-21 14:35:47,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 14:35:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 807 transitions. [2020-07-21 14:35:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-21 14:35:47,870 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:35:47,871 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 14:35:48,083 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:35:48,084 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:35:48,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:35:48,085 INFO L82 PathProgramCache]: Analyzing trace with hash -326635612, now seen corresponding path program 1 times [2020-07-21 14:35:48,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:35:48,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1932684949] [2020-07-21 14:35:48,086 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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 14:35:48,188 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:35:48,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:35:48,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-21 14:35:48,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:35:48,229 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 14:35:48,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:35:48,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1932684949] [2020-07-21 14:35:48,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:35:48,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:35:48,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126928024] [2020-07-21 14:35:48,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:35:48,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:35:48,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:35:48,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:35:48,232 INFO L87 Difference]: Start difference. First operand 608 states and 807 transitions. Second operand 3 states. [2020-07-21 14:35:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:35:48,292 INFO L93 Difference]: Finished difference Result 1361 states and 1836 transitions. [2020-07-21 14:35:48,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:35:48,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-21 14:35:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:35:48,300 INFO L225 Difference]: With dead ends: 1361 [2020-07-21 14:35:48,300 INFO L226 Difference]: Without dead ends: 842 [2020-07-21 14:35:48,304 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 14:35:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2020-07-21 14:35:48,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 703. [2020-07-21 14:35:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2020-07-21 14:35:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 933 transitions. [2020-07-21 14:35:48,355 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 933 transitions. Word has length 66 [2020-07-21 14:35:48,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:35:48,356 INFO L479 AbstractCegarLoop]: Abstraction has 703 states and 933 transitions. [2020-07-21 14:35:48,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:35:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 933 transitions. [2020-07-21 14:35:48,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-21 14:35:48,359 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:35:48,359 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 14:35:48,574 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:35:48,575 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:35:48,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:35:48,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1515944043, now seen corresponding path program 1 times [2020-07-21 14:35:48,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:35:48,578 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [402907215] [2020-07-21 14:35:48,578 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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 14:35:48,697 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 14:35:48,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:35:48,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 14:35:48,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:35:48,726 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 14:35:48,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:35:48,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [402907215] [2020-07-21 14:35:48,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:35:48,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:35:48,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378367584] [2020-07-21 14:35:48,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:35:48,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:35:48,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:35:48,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:35:48,730 INFO L87 Difference]: Start difference. First operand 703 states and 933 transitions. Second operand 3 states. [2020-07-21 14:35:48,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:35:48,799 INFO L93 Difference]: Finished difference Result 1605 states and 2241 transitions. [2020-07-21 14:35:48,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:35:48,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-07-21 14:35:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:35:48,806 INFO L225 Difference]: With dead ends: 1605 [2020-07-21 14:35:48,806 INFO L226 Difference]: Without dead ends: 743 [2020-07-21 14:35:48,811 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 14:35:48,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2020-07-21 14:35:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2020-07-21 14:35:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2020-07-21 14:35:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 995 transitions. [2020-07-21 14:35:48,857 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 995 transitions. Word has length 86 [2020-07-21 14:35:48,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:35:48,857 INFO L479 AbstractCegarLoop]: Abstraction has 743 states and 995 transitions. [2020-07-21 14:35:48,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:35:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 995 transitions. [2020-07-21 14:35:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-07-21 14:35:48,882 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:35:48,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:35:49,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:35:49,096 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:35:49,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:35:49,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1402320435, now seen corresponding path program 1 times [2020-07-21 14:35:49,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:35:49,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1687158327] [2020-07-21 14:35:49,098 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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 14:35:49,202 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 14:35:49,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:35:49,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 14:35:49,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:35:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-07-21 14:35:49,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:35:49,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1687158327] [2020-07-21 14:35:49,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:35:49,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:35:49,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758302292] [2020-07-21 14:35:49,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:35:49,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:35:49,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:35:49,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:35:49,238 INFO L87 Difference]: Start difference. First operand 743 states and 995 transitions. Second operand 3 states. [2020-07-21 14:35:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:35:49,280 INFO L93 Difference]: Finished difference Result 1401 states and 1866 transitions. [2020-07-21 14:35:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:35:49,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2020-07-21 14:35:49,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:35:49,286 INFO L225 Difference]: With dead ends: 1401 [2020-07-21 14:35:49,286 INFO L226 Difference]: Without dead ends: 675 [2020-07-21 14:35:49,290 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 14:35:49,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2020-07-21 14:35:49,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2020-07-21 14:35:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2020-07-21 14:35:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 888 transitions. [2020-07-21 14:35:49,334 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 888 transitions. Word has length 118 [2020-07-21 14:35:49,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:35:49,334 INFO L479 AbstractCegarLoop]: Abstraction has 675 states and 888 transitions. [2020-07-21 14:35:49,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:35:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 888 transitions. [2020-07-21 14:35:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-21 14:35:49,338 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:35:49,338 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 14:35:49,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:35:49,552 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:35:49,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:35:49,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1796555727, now seen corresponding path program 1 times [2020-07-21 14:35:49,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:35:49,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2054580525] [2020-07-21 14:35:49,554 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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 14:35:49,651 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 14:35:49,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:35:49,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-21 14:35:49,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:35:49,694 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 14:35:49,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:35:49,817 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 14:35:49,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2054580525] [2020-07-21 14:35:49,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-21 14:35:49,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2020-07-21 14:35:49,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318901613] [2020-07-21 14:35:49,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-21 14:35:49,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:35:49,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-21 14:35:49,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-21 14:35:49,819 INFO L87 Difference]: Start difference. First operand 675 states and 888 transitions. Second operand 4 states. [2020-07-21 14:35:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:35:49,974 INFO L93 Difference]: Finished difference Result 747 states and 1011 transitions. [2020-07-21 14:35:49,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-21 14:35:49,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-07-21 14:35:49,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:35:49,980 INFO L225 Difference]: With dead ends: 747 [2020-07-21 14:35:49,981 INFO L226 Difference]: Without dead ends: 744 [2020-07-21 14:35:49,982 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 14:35:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2020-07-21 14:35:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 676. [2020-07-21 14:35:50,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2020-07-21 14:35:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 888 transitions. [2020-07-21 14:35:50,026 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 888 transitions. Word has length 98 [2020-07-21 14:35:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:35:50,027 INFO L479 AbstractCegarLoop]: Abstraction has 676 states and 888 transitions. [2020-07-21 14:35:50,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-21 14:35:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 888 transitions. [2020-07-21 14:35:50,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-21 14:35:50,030 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:35:50,030 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 14:35:50,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:35:50,244 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:35:50,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:35:50,244 INFO L82 PathProgramCache]: Analyzing trace with hash -141651634, now seen corresponding path program 1 times [2020-07-21 14:35:50,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:35:50,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [93861836] [2020-07-21 14:35:50,245 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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 14:35:50,364 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 14:35:50,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:35:50,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-21 14:35:50,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:35:50,460 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 14:35:50,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 14:35:50,656 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 14:35:50,656 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [93861836] [2020-07-21 14:35:50,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 14:35:50,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2020-07-21 14:35:50,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731597331] [2020-07-21 14:35:50,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-21 14:35:50,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:35:50,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-21 14:35:50,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-21 14:35:50,660 INFO L87 Difference]: Start difference. First operand 676 states and 888 transitions. Second operand 12 states. [2020-07-21 14:35:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:35:52,739 INFO L93 Difference]: Finished difference Result 2952 states and 5171 transitions. [2020-07-21 14:35:52,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-21 14:35:52,740 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2020-07-21 14:35:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:35:52,772 INFO L225 Difference]: With dead ends: 2952 [2020-07-21 14:35:52,773 INFO L226 Difference]: Without dead ends: 2949 [2020-07-21 14:35:52,776 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 14:35:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-07-21 14:35:53,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2781. [2020-07-21 14:35:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2781 states. [2020-07-21 14:35:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 4672 transitions. [2020-07-21 14:35:53,031 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 4672 transitions. Word has length 99 [2020-07-21 14:35:53,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:35:53,032 INFO L479 AbstractCegarLoop]: Abstraction has 2781 states and 4672 transitions. [2020-07-21 14:35:53,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-21 14:35:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 4672 transitions. [2020-07-21 14:35:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-21 14:35:53,039 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:35:53,039 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 14:35:53,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:35:53,254 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:35:53,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:35:53,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2001332551, now seen corresponding path program 2 times [2020-07-21 14:35:53,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:35:53,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [978023267] [2020-07-21 14:35:53,257 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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 14:35:53,394 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 14:35:53,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:35:53,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 14:35:53,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:35:53,425 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 14:35:53,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:35:53,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [978023267] [2020-07-21 14:35:53,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:35:53,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:35:53,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072355202] [2020-07-21 14:35:53,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:35:53,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:35:53,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:35:53,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:35:53,428 INFO L87 Difference]: Start difference. First operand 2781 states and 4672 transitions. Second operand 3 states. [2020-07-21 14:35:53,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:35:53,571 INFO L93 Difference]: Finished difference Result 4277 states and 7666 transitions. [2020-07-21 14:35:53,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:35:53,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2020-07-21 14:35:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:35:53,602 INFO L225 Difference]: With dead ends: 4277 [2020-07-21 14:35:53,602 INFO L226 Difference]: Without dead ends: 2139 [2020-07-21 14:35:53,641 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 14:35:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2020-07-21 14:35:53,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2075. [2020-07-21 14:35:53,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2075 states. [2020-07-21 14:35:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3182 transitions. [2020-07-21 14:35:53,866 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3182 transitions. Word has length 125 [2020-07-21 14:35:53,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:35:53,867 INFO L479 AbstractCegarLoop]: Abstraction has 2075 states and 3182 transitions. [2020-07-21 14:35:53,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:35:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3182 transitions. [2020-07-21 14:35:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-07-21 14:35:53,878 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 14:35:53,879 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:35:54,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:35:54,092 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 14:35:54,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 14:35:54,092 INFO L82 PathProgramCache]: Analyzing trace with hash 765389387, now seen corresponding path program 1 times [2020-07-21 14:35:54,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 14:35:54,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [16965141] [2020-07-21 14:35:54,093 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) 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 14:35:54,208 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 14:35:54,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 14:35:54,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 14:35:54,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 14:35:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-07-21 14:35:54,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 14:35:54,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [16965141] [2020-07-21 14:35:54,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 14:35:54,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 14:35:54,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195722236] [2020-07-21 14:35:54,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 14:35:54,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 14:35:54,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 14:35:54,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 14:35:54,281 INFO L87 Difference]: Start difference. First operand 2075 states and 3182 transitions. Second operand 3 states. [2020-07-21 14:35:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 14:35:54,347 INFO L93 Difference]: Finished difference Result 2687 states and 4135 transitions. [2020-07-21 14:35:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 14:35:54,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2020-07-21 14:35:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 14:35:54,349 INFO L225 Difference]: With dead ends: 2687 [2020-07-21 14:35:54,349 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 14:35:54,364 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 169 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 14:35:54,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 14:35:54,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 14:35:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 14:35:54,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 14:35:54,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 172 [2020-07-21 14:35:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 14:35:54,366 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 14:35:54,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 14:35:54,366 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 14:35:54,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 14:35:54,580 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 14:35:54,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 14:35:56,643 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-07-21 14:35:56,912 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-07-21 14:35:57,052 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2020-07-21 14:35:57,394 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2020-07-21 14:35:57,611 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2020-07-21 14:35:57,777 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2020-07-21 14:35:58,005 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2020-07-21 14:35:58,234 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-07-21 14:35:59,317 WARN L193 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 91 [2020-07-21 14:35:59,551 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2020-07-21 14:35:59,741 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2020-07-21 14:36:00,711 WARN L193 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 91 [2020-07-21 14:36:01,517 WARN L193 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2020-07-21 14:36:01,851 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 75 [2020-07-21 14:36:02,136 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2020-07-21 14:36:02,574 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2020-07-21 14:36:03,464 WARN L193 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 91 [2020-07-21 14:36:03,711 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-07-21 14:36:03,989 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2020-07-21 14:36:04,312 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2020-07-21 14:36:04,722 WARN L193 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2020-07-21 14:36:04,880 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 42 [2020-07-21 14:36:05,092 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2020-07-21 14:36:05,096 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2020-07-21 14:36:05,097 INFO L268 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2020-07-21 14:36:05,097 INFO L268 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2020-07-21 14:36:05,097 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2020-07-21 14:36:05,097 INFO L271 CegarLoopResult]: At program point L226(lines 213 228) the Hoare annotation is: true [2020-07-21 14:36:05,098 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2020-07-21 14:36:05,098 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2020-07-21 14:36:05,098 INFO L268 CegarLoopResult]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2020-07-21 14:36:05,098 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 14:36:05,098 INFO L268 CegarLoopResult]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2020-07-21 14:36:05,099 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 14:36:05,099 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 14:36:05,099 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2020-07-21 14:36:05,099 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2020-07-21 14:36:05,100 INFO L268 CegarLoopResult]: For program point L355(line 355) no Hoare annotation was computed. [2020-07-21 14:36:05,100 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 14:36:05,100 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)) (.cse7 (not (<= ~c_dr_pc~0 0))) (.cse6 (not (<= 2 |old(~c_dr_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 .cse5 .cse6) (or (not (= 0 ~c_num_read~0)) .cse7 .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))) (or (<= 2 ~c_dr_st~0) .cse7 .cse6))) [2020-07-21 14:36:05,100 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse7 (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)|))) (.cse10 (not (= 0 |old(~p_num_write~0)|))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse11 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse8 (<= ~p_dw_pc~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= 1 ~q_free~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (not (<= |old(~p_dw_pc~0)| 0))) (.cse4 (<= 2 ~c_dr_st~0)) (.cse13 (not (<= ~c_dr_pc~0 0))) (.cse3 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse0 .cse1 .cse2 .cse3 (and .cse4 (= ~c_num_read~0 ~p_num_write~0) .cse5 .cse6)) (or .cse7 .cse0 (and .cse8 .cse9) .cse1 .cse10 .cse2 .cse11 .cse3 .cse12) (or .cse13 .cse1 (and .cse8 .cse5) .cse3 .cse12) (or .cse7 .cse13 .cse0 .cse1 .cse10 .cse2 .cse11 (and .cse8 .cse9 (= 0 ~p_num_write~0) .cse5 .cse6) .cse12) (or .cse4 .cse13 .cse3))) [2020-07-21 14:36:05,100 INFO L264 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse0 (not (= 0 ~c_num_read~0))) (.cse7 (not (= 0 |old(~p_num_write~0)|))) (.cse9 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse5 (<= ~p_dw_pc~0 0)) (.cse10 (not (<= |old(~p_dw_pc~0)| 0))) (.cse4 (= 0 ~q_free~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not (= 1 |old(~q_free~0)|))) (.cse8 (not (= 1 ~p_dw_i~0))) (.cse12 (<= 2 ~c_dr_st~0)) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse11 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 (= 1 ~p_num_write~0) .cse6) .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse5 .cse2 .cse3 .cse7 .cse8 .cse9 .cse11 .cse10) (or .cse1 .cse5 .cse3 .cse11 .cse10) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (and .cse12 .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6) .cse2 .cse3 .cse8 .cse11) (or .cse12 .cse1 .cse11))) [2020-07-21 14:36:05,100 INFO L268 CegarLoopResult]: For program point L124-1(line 124) no Hoare annotation was computed. [2020-07-21 14:36:05,101 INFO L268 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2020-07-21 14:36:05,101 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2020-07-21 14:36:05,101 INFO L264 CegarLoopResult]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.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)|))) (.cse8 (not (= 0 |old(~p_num_write~0)|))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse9 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse7 (<= ~p_dw_pc~0 0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (not (<= |old(~p_dw_pc~0)| 0))) (.cse4 (<= 2 ~c_dr_st~0)) (.cse11 (not (<= ~c_dr_pc~0 0))) (.cse3 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse0 .cse1 .cse2 .cse3 (and .cse4 (= ~c_num_read~0 ~p_num_write~0) .cse5)) (or .cse6 .cse7 .cse0 .cse1 .cse8 .cse2 .cse9 .cse3 .cse10) (or .cse11 .cse7 .cse1 .cse3 .cse10) (or .cse6 .cse11 .cse0 .cse1 .cse8 .cse2 .cse9 (and .cse7 (= 0 ~p_num_write~0) .cse5) .cse10) (or .cse4 .cse11 .cse3))) [2020-07-21 14:36:05,101 INFO L264 CegarLoopResult]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse4 (= 0 ~q_free~0)) (.cse10 (= 1 ~q_free~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (not (= 0 ~c_num_read~0))) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (not (= 0 |old(~p_num_write~0)|))) (.cse8 (not (= 1 ~p_dw_i~0))) (.cse9 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse5 (<= ~p_dw_pc~0 0)) (.cse3 (not (= 1 |old(~q_free~0)|))) (.cse11 (not (<= |old(~p_dw_pc~0)| 0))) (.cse13 (<= 2 ~c_dr_st~0)) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse12 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 (= 1 ~p_num_write~0) .cse6) .cse7 .cse8 .cse9 (and .cse5 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_num_write~0) .cse10 .cse6) .cse11) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse2 .cse3 .cse8 (and .cse4 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6) .cse12 (and .cse13 (= ~c_num_read~0 ~p_num_write~0) .cse10 .cse6)) (or .cse0 .cse2 .cse5 .cse3 .cse7 .cse8 .cse9 .cse12 .cse11) (or .cse1 .cse5 .cse3 .cse12 .cse11) (or .cse13 .cse1 .cse12))) [2020-07-21 14:36:05,101 INFO L268 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2020-07-21 14:36:05,102 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-07-21 14:36:05,102 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-21 14:36:05,102 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-07-21 14:36:05,102 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-07-21 14:36:05,102 INFO L264 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (<= 2 ~c_dr_st~0)) (.cse3 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 (not (<= 2 |old(~p_dw_st~0)|)) .cse1 (not (= ~c_num_read~0 ~p_num_write~0)) (not (= 1 ~q_free~0)) (<= 2 ~p_dw_st~0) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse2 .cse0 .cse1 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse3 (not (= 0 ~q_free~0))) (or (not (<= ~c_dr_pc~0 0)) .cse2 .cse3))) [2020-07-21 14:36:05,102 INFO L268 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2020-07-21 14:36:05,103 INFO L268 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-07-21 14:36:05,103 INFO L268 CegarLoopResult]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2020-07-21 14:36:05,103 INFO L268 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2020-07-21 14:36:05,103 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2020-07-21 14:36:05,103 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (<= 2 ~c_dr_st~0)) (.cse3 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 (not (<= 2 |old(~p_dw_st~0)|)) .cse1 (not (= ~c_num_read~0 ~p_num_write~0)) (not (= 1 ~q_free~0)) (<= 2 ~p_dw_st~0) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse2 .cse0 .cse1 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse3 (not (= 0 ~q_free~0))) (or (not (<= ~c_dr_pc~0 0)) .cse2 .cse3))) [2020-07-21 14:36:05,103 INFO L264 CegarLoopResult]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (<= 2 ~c_dr_st~0)) (.cse3 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 (not (<= 2 |old(~p_dw_st~0)|)) .cse1 (not (= ~c_num_read~0 ~p_num_write~0)) (= 0 ~p_dw_st~0) (not (= 1 ~q_free~0)) (<= 2 ~p_dw_st~0) (not (= ~c_last_read~0 ~p_last_write~0))) (or .cse2 .cse0 .cse1 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse3 (not (= 0 ~q_free~0))) (or (not (<= ~c_dr_pc~0 0)) .cse2 .cse3))) [2020-07-21 14:36:05,104 INFO L268 CegarLoopResult]: For program point L72-1(line 72) no Hoare annotation was computed. [2020-07-21 14:36:05,104 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-21 14:36:05,104 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 14:36:05,104 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-21 14:36:05,104 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse20 (not (= 0 |old(~p_num_write~0)|))) (.cse13 (<= ~p_dw_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= 0 ~p_num_write~0)) (.cse15 (not (<= |old(~p_dw_pc~0)| 0))) (.cse21 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse26 (<= 2 ~p_dw_st~0)) (.cse23 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse10 (not (= 1 |old(~c_num_read~0)|))) (.cse7 (<= ~c_dr_pc~0 0)) (.cse6 (not (<= |old(~c_dr_pc~0)| 0))) (.cse22 (<= 2 ~c_dr_st~0)) (.cse25 (= ~c_num_read~0 ~p_num_write~0)) (.cse17 (= 0 ~p_dw_st~0)) (.cse14 (= 1 ~q_free~0)) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= 0 |old(~p_dw_st~0)|))) (.cse9 (not (= 1 |old(~q_free~0)|))) (.cse24 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse11 (not (<= 2 |old(~c_dr_st~0)|))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not (= 1 |old(~p_num_write~0)|))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse5 (not (= 0 |old(~c_num_read~0)|))) (.cse12 (= 1 ~p_num_write~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse9 .cse4 .cse10 .cse11 .cse12) (or .cse9 (and .cse13 .cse14) .cse6 .cse11 .cse15) (or (and .cse13 (= 0 ~c_num_read~0) .cse16 .cse17 .cse7 .cse18 .cse14 .cse19) .cse0 .cse8 .cse9 .cse20 .cse4 .cse5 .cse6 .cse15 .cse21) (or .cse0 .cse8 .cse9 .cse20 .cse4 .cse5 .cse11 (and .cse13 .cse16 .cse18) .cse15 .cse21) (or .cse22 .cse0 .cse2 .cse3 .cse4 .cse11 .cse23) (or .cse0 .cse9 .cse2 .cse4 .cse24 (and .cse22 .cse25 .cse14 .cse19 .cse26) .cse11) (or .cse8 .cse6 .cse17 .cse11) (or .cse0 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse19 .cse26) .cse2 .cse3 .cse4 .cse23) (or .cse0 .cse1 .cse9 .cse2 .cse4 .cse10 .cse11 .cse12) (or (and .cse22 .cse7) .cse6 .cse11) (or (and .cse22 .cse25 .cse17 .cse14 .cse19) .cse0 .cse8 .cse9 .cse4 .cse24 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12))) [2020-07-21 14:36:05,105 INFO L264 CegarLoopResult]: At program point L254(line 254) the Hoare annotation is: (let ((.cse6 (<= 2 ~c_dr_st~0)) (.cse15 (= 1 ~p_dw_i~0)) (.cse13 (= 1 ~q_free~0)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse8 (not (<= |old(~c_dr_pc~0)| 0))) (.cse7 (<= ~c_dr_pc~0 0)) (.cse12 (not (= 0 |old(~p_dw_st~0)|))) (.cse10 (not (= 1 |old(~q_free~0)|))) (.cse3 (and .cse6 .cse15 (= ~c_num_read~0 ~p_num_write~0) .cse13 .cse14)) (.cse11 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse4 (not .cse15)) (.cse9 (not (<= 2 |old(~c_dr_st~0)|))) (.cse5 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or (and .cse6 .cse7) .cse8 .cse9) (or .cse0 .cse10 .cse1 .cse4 .cse11 .cse9) (or .cse0 .cse12 .cse10 .cse3 (not (= 0 |old(~p_num_write~0)|)) .cse4 (not (= 0 |old(~c_num_read~0)|)) .cse8 (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) .cse7 (= 0 ~p_num_write~0) .cse13 .cse14) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse0 .cse12 .cse10 .cse3 .cse4 .cse11 .cse9) (or .cse0 .cse1 .cse2 .cse4 .cse9 .cse5)))) [2020-07-21 14:36:05,105 INFO L268 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2020-07-21 14:36:05,105 INFO L268 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2020-07-21 14:36:05,105 INFO L268 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-07-21 14:36:05,106 INFO L264 CegarLoopResult]: At program point L238(line 238) the Hoare annotation is: (let ((.cse8 (<= 2 ~c_dr_st~0)) (.cse23 (= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= 0 ~p_dw_st~0)) (.cse14 (= 1 ~q_free~0)) (.cse9 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse22 (= 1 ~p_dw_i~0)) (.cse15 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (<= 2 ~p_dw_st~0))) (let ((.cse6 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse11 (not (= 0 |old(~p_dw_st~0)|))) (.cse4 (and (= 0 ~q_free~0) .cse9 .cse22 .cse15 .cse24)) (.cse5 (and .cse8 .cse22 .cse23 .cse12 .cse14 .cse15)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse18 (not (<= |old(~c_dr_pc~0)| 0))) (.cse16 (not (= 1 |old(~q_free~0)|))) (.cse21 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse7 (and .cse8 .cse22 .cse23 .cse14 .cse15 .cse24)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse19 (not (= 1 |old(~p_num_write~0)|))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse3 (not .cse22)) (.cse17 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (not (<= 2 |old(~c_dr_st~0)|))) (.cse20 (= 1 ~p_num_write~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse8 .cse9) .cse10 .cse6) (or .cse0 .cse11 (not (= 0 |old(~p_num_write~0)|)) .cse4 (not (<= |old(~p_dw_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) .cse12 .cse13 (= 0 ~p_num_write~0) .cse14 .cse15) .cse16 .cse3 .cse17 .cse18 .cse5 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse7) (or .cse0 .cse19 .cse16 .cse1 .cse3 (not (= 1 |old(~c_num_read~0)|)) .cse10 .cse20) (or .cse0 .cse11 .cse16 .cse4 .cse3 .cse21 .cse5 .cse10 .cse7) (or (and .cse8 .cse13) .cse18 .cse10) (or .cse0 .cse16 .cse1 .cse3 .cse21 .cse10 .cse7) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse17 .cse10 .cse20)))) [2020-07-21 14:36:05,106 INFO L264 CegarLoopResult]: At program point L269(line 269) the Hoare annotation is: (let ((.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= 1 ~p_dw_i~0))) (let ((.cse1 (not (= 0 |old(~p_dw_st~0)|))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse5 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse8 (not (<= |old(~c_dr_pc~0)| 0))) (.cse6 (not (<= 2 |old(~c_dr_st~0)|))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse9 (not (<= 2 |old(~p_dw_st~0)|))) (.cse10 (not (= 0 |old(~q_free~0)|))) (.cse4 (not .cse12)) (.cse3 (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse12 .cse7 (<= 2 ~p_dw_st~0))) (.cse11 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (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) .cse7) .cse0 .cse1 .cse2 (not (= 0 |old(~p_num_write~0)|)) .cse4 .cse3 (not (= 0 |old(~c_num_read~0)|)) .cse8 (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (or .cse0 .cse2 .cse9 .cse4 .cse5 .cse6) (or .cse8 .cse6) (or .cse0 .cse9 .cse10 .cse4 .cse6 .cse11) (or .cse0 .cse9 .cse10 .cse4 .cse3 .cse11)))) [2020-07-21 14:36:05,106 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2020-07-21 14:36:05,106 INFO L268 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2020-07-21 14:36:05,106 INFO L268 CegarLoopResult]: For program point L247(lines 237 277) no Hoare annotation was computed. [2020-07-21 14:36:05,107 INFO L264 CegarLoopResult]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse8 (<= 2 ~c_dr_st~0)) (.cse23 (= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= 0 ~p_dw_st~0)) (.cse14 (= 1 ~q_free~0)) (.cse9 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse22 (= 1 ~p_dw_i~0)) (.cse15 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (<= 2 ~p_dw_st~0))) (let ((.cse6 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse11 (not (= 0 |old(~p_dw_st~0)|))) (.cse4 (and (= 0 ~q_free~0) .cse9 .cse22 .cse15 .cse24)) (.cse5 (and .cse8 .cse22 .cse23 .cse12 .cse14 .cse15)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse18 (not (<= |old(~c_dr_pc~0)| 0))) (.cse16 (not (= 1 |old(~q_free~0)|))) (.cse21 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse7 (and .cse8 .cse22 .cse23 .cse14 .cse15 .cse24)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse19 (not (= 1 |old(~p_num_write~0)|))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse3 (not .cse22)) (.cse17 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (not (<= 2 |old(~c_dr_st~0)|))) (.cse20 (= 1 ~p_num_write~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse8 .cse9) .cse10 .cse6) (or .cse0 .cse11 (not (= 0 |old(~p_num_write~0)|)) .cse4 (not (<= |old(~p_dw_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) .cse12 .cse13 (= 0 ~p_num_write~0) .cse14 .cse15) .cse16 .cse3 .cse17 .cse18 .cse5 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse7) (or .cse0 .cse19 .cse16 .cse1 .cse3 (not (= 1 |old(~c_num_read~0)|)) .cse10 .cse20) (or .cse0 .cse11 .cse16 .cse4 .cse3 .cse21 .cse5 .cse10 .cse7) (or (and .cse8 .cse13) .cse18 .cse10) (or .cse0 .cse16 .cse1 .cse3 .cse21 .cse10 .cse7) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse17 .cse10 .cse20)))) [2020-07-21 14:36:05,107 INFO L268 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2020-07-21 14:36:05,107 INFO L264 CegarLoopResult]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse8 (<= 2 ~c_dr_st~0)) (.cse23 (= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= 0 ~p_dw_st~0)) (.cse14 (= 1 ~q_free~0)) (.cse9 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse22 (= 1 ~p_dw_i~0)) (.cse15 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (<= 2 ~p_dw_st~0))) (let ((.cse6 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse11 (not (= 0 |old(~p_dw_st~0)|))) (.cse4 (and (= 0 ~q_free~0) .cse9 .cse22 .cse15 .cse24)) (.cse5 (and .cse8 .cse22 .cse23 .cse12 .cse14 .cse15)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse18 (not (<= |old(~c_dr_pc~0)| 0))) (.cse16 (not (= 1 |old(~q_free~0)|))) (.cse21 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse7 (and .cse8 .cse22 .cse23 .cse14 .cse15 .cse24)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse19 (not (= 1 |old(~p_num_write~0)|))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse3 (not .cse22)) (.cse17 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (not (<= 2 |old(~c_dr_st~0)|))) (.cse20 (= 1 ~p_num_write~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse8 .cse9) .cse10 .cse6) (or .cse0 .cse11 (not (= 0 |old(~p_num_write~0)|)) .cse4 (not (<= |old(~p_dw_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) .cse12 .cse13 (= 0 ~p_num_write~0) .cse14 .cse15) .cse16 .cse3 .cse17 .cse18 .cse5 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse7) (or .cse0 .cse19 .cse16 .cse1 .cse3 (not (= 1 |old(~c_num_read~0)|)) .cse10 .cse20) (or .cse0 .cse11 .cse16 .cse4 .cse3 .cse21 .cse5 .cse10 .cse7) (or (and .cse8 .cse13) .cse18 .cse10) (or .cse0 .cse16 .cse1 .cse3 .cse21 .cse10 .cse7) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse17 .cse10 .cse20)))) [2020-07-21 14:36:05,107 INFO L268 CegarLoopResult]: For program point L290-1(line 290) no Hoare annotation was computed. [2020-07-21 14:36:05,108 INFO L271 CegarLoopResult]: At program point L299(lines 288 301) the Hoare annotation is: true [2020-07-21 14:36:05,108 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2020-07-21 14:36:05,108 INFO L268 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2020-07-21 14:36:05,108 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2020-07-21 14:36:05,108 INFO L271 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: true [2020-07-21 14:36:05,108 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2020-07-21 14:36:05,108 INFO L264 CegarLoopResult]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse4 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse5 (not (= 1 ~q_free~0))) (.cse6 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse1 (= 0 is_do_read_c_triggered_~__retres1~1))) (and (or .cse0 .cse1 (not (<= 2 ~c_dr_st~0))) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse1 (not (<= 2 ~p_dw_st~0)) .cse6) (or .cse0 .cse2 (not (= 0 ~p_dw_st~0)) .cse3 .cse4 .cse5 .cse1 .cse6) (or (not (<= ~p_dw_pc~0 0)) (not (= 0 ~c_num_read~0)) .cse0 .cse2 .cse3 (not (= 1 ~p_num_write~0)) (not (= 0 ~q_free~0)) .cse1))) [2020-07-21 14:36:05,109 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2020-07-21 14:36:05,109 INFO L268 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2020-07-21 14:36:05,109 INFO L268 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2020-07-21 14:36:05,109 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2020-07-21 14:36:05,109 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2020-07-21 14:36:05,109 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2020-07-21 14:36:05,109 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 14:36:05,110 INFO L268 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2020-07-21 14:36:05,110 INFO L268 CegarLoopResult]: For program point L318(line 318) no Hoare annotation was computed. [2020-07-21 14:36:05,110 INFO L264 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse4 (= 0 ~p_dw_st~0)) (.cse6 (<= ~c_dr_pc~0 0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse5 (= 1 ~q_free~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (<= 2 ~p_dw_st~0))) (or (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse0) (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)|)) (not (<= |old(~p_dw_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) .cse4 .cse6 (= 0 ~p_num_write~0) .cse5 .cse0) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and .cse2 .cse6) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse2 .cse3 .cse5 .cse0 .cse1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-21 14:36:05,110 INFO L264 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse4 (= 0 ~p_dw_st~0)) (.cse6 (<= ~c_dr_pc~0 0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse5 (= 1 ~q_free~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (<= 2 ~p_dw_st~0))) (or (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse0) (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)|)) (not (<= |old(~p_dw_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) .cse4 .cse6 (= 0 ~p_num_write~0) .cse5 .cse0) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and .cse2 .cse6) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse2 .cse3 .cse5 .cse0 .cse1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-21 14:36:05,110 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2020-07-21 14:36:05,110 INFO L268 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2020-07-21 14:36:05,111 INFO L264 CegarLoopResult]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse4 (= 0 ~p_dw_st~0)) (.cse6 (<= ~c_dr_pc~0 0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse5 (= 1 ~q_free~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (<= 2 ~p_dw_st~0))) (or (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse0) (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)|)) (not (<= |old(~p_dw_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) .cse4 .cse6 (= 0 ~p_num_write~0) .cse5 .cse0) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and .cse2 .cse6) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse2 .cse3 .cse5 .cse0 .cse1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-21 14:36:05,111 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 14:36:05,111 INFO L271 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2020-07-21 14:36:05,111 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-21 14:36:05,111 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 14:36:05,112 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-21 14:36:05,112 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-21 14:36:05,112 INFO L268 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2020-07-21 14:36:05,112 INFO L268 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2020-07-21 14:36:05,112 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2020-07-21 14:36:05,112 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2020-07-21 14:36:05,112 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2020-07-21 14:36:05,112 INFO L271 CegarLoopResult]: At program point L43(lines 31 45) the Hoare annotation is: true [2020-07-21 14:36:05,113 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2020-07-21 14:36:05,113 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2020-07-21 14:36:05,113 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))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse1 (<= 2 ~c_dr_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 (= 0 ~c_num_read~0) .cse2 .cse3 .cse4) .cse5 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))) (let ((.cse6 (= ~c_num_read~0 ~p_num_write~0))) (or .cse0 (not (<= 2 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) .cse5 (and .cse1 .cse6 .cse4 (<= 2 ~p_dw_st~0)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) (and .cse1 .cse2 .cse6 .cse3 .cse4))))) [2020-07-21 14:36:05,113 INFO L268 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2020-07-21 14:36:05,113 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 1 ~p_dw_i~0)))) (and (or .cse0 (not (<= 2 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) .cse1 (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)|)) .cse1 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))))) [2020-07-21 14:36:05,114 INFO L264 CegarLoopResult]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse1 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= 0 |old(~q_free~0)|))) (.cse8 (not (= 1 ~p_dw_i~0))) (.cse9 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (not (<= |old(~c_dr_pc~0)| 0))) (.cse4 (= 1 ~q_free~0))) (and (let ((.cse2 (= ~c_num_read~0 ~p_num_write~0)) (.cse7 (<= 2 ~p_dw_st~0))) (or .cse0 (and .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse7) .cse8 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) (and .cse1 .cse2 .cse4 .cse7))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (and (= 0 ~c_num_read~0) .cse1 .cse3 .cse4) .cse8 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse9 .cse10 (not (= 0 ~p_num_write~0))) (or .cse0 .cse5 .cse6 .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) (not (= 1 ~p_num_write~0)) .cse4))) [2020-07-21 14:36:05,114 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))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (= 0 |old(~c_num_read~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 (not (= 0 ~p_num_write~0))) (or .cse0 .cse4 .cse5 (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 2 ~p_dw_st~0)) .cse1 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or .cse0 .cse4 .cse5 .cse1 .cse2 .cse3 (not (= 1 ~p_num_write~0))))) [2020-07-21 14:36:05,114 INFO L268 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2020-07-21 14:36:05,114 INFO L268 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2020-07-21 14:36:05,114 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))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (= 0 |old(~c_num_read~0)|))) (.cse3 (not (<= |old(~c_dr_pc~0)| 0))) (.cse4 (<= ~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 (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse4 (= 1 ~q_free~0)) (not (= 0 ~p_num_write~0))) (or .cse0 .cse5 .cse6 (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 2 ~p_dw_st~0)) .cse1 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or .cse0 .cse5 .cse6 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0))))) [2020-07-21 14:36:05,114 INFO L268 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2020-07-21 14:36:05,115 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (= 1 ~p_dw_i~0)))) (and (or .cse0 (not (<= 2 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) .cse1 (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)|)) .cse1 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))))) [2020-07-21 14:36:05,115 INFO L268 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2020-07-21 14:36:05,115 INFO L268 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2020-07-21 14:36:05,115 INFO L264 CegarLoopResult]: At program point L169(line 169) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (= 0 |old(~c_num_read~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 (not (= 0 ~p_num_write~0))) (or .cse0 .cse4 .cse5 .cse1 (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) (and (= ~c_last_read~0 ~p_last_write~0) (= ~c_num_read~0 ~p_num_write~0) (= 1 ~q_free~0) (<= 2 ~p_dw_st~0))) (or .cse0 .cse4 .cse5 .cse1 .cse2 .cse3 (<= ~c_dr_pc~0 0) (not (= 1 ~p_num_write~0))))) [2020-07-21 14:36:05,115 INFO L268 CegarLoopResult]: For program point L169-1(line 169) no Hoare annotation was computed. [2020-07-21 14:36:05,115 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2020-07-21 14:36:05,115 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2020-07-21 14:36:05,116 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 14:36:05,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 02:36:05 BoogieIcfgContainer [2020-07-21 14:36:05,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 14:36:05,174 INFO L168 Benchmark]: Toolchain (without parser) took 20766.87 ms. Allocated memory was 137.4 MB in the beginning and 494.9 MB in the end (delta: 357.6 MB). Free memory was 101.9 MB in the beginning and 207.9 MB in the end (delta: -106.0 MB). Peak memory consumption was 377.5 MB. Max. memory is 7.1 GB. [2020-07-21 14:36:05,175 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-21 14:36:05,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.31 ms. Allocated memory is still 137.4 MB. Free memory was 101.5 MB in the beginning and 88.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2020-07-21 14:36:05,176 INFO L168 Benchmark]: Boogie Preprocessor took 140.77 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 88.8 MB in the beginning and 178.8 MB in the end (delta: -90.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-21 14:36:05,177 INFO L168 Benchmark]: RCFGBuilder took 499.52 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 151.8 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2020-07-21 14:36:05,178 INFO L168 Benchmark]: TraceAbstraction took 19740.41 ms. Allocated memory was 201.3 MB in the beginning and 494.9 MB in the end (delta: 293.6 MB). Free memory was 151.8 MB in the beginning and 207.9 MB in the end (delta: -56.2 MB). Peak memory consumption was 363.3 MB. Max. memory is 7.1 GB. [2020-07-21 14:36:05,181 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.24 ms. Allocated memory is still 137.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 372.31 ms. Allocated memory is still 137.4 MB. Free memory was 101.5 MB in the beginning and 88.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.77 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 88.8 MB in the beginning and 178.8 MB in the end (delta: -90.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 499.52 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 151.8 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19740.41 ms. Allocated memory was 201.3 MB in the beginning and 494.9 MB in the end (delta: 293.6 MB). Free memory was 151.8 MB in the beginning and 207.9 MB in the end (delta: -56.2 MB). Peak memory consumption was 363.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: (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 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)) || ((!(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)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) || (((((((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))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(\old(c_last_read) == \old(p_last_write))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 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))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(\old(c_num_read) == \old(p_num_write))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(2 <= \old(c_dr_st))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && (((2 <= c_dr_st && c_dr_pc <= 0) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st)))) && ((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 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))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write) - 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))) || !(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))) || ((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(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))) || !(\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)) && ((((((!(c_num_read == \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(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))) && ((((((((!(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))) && ((((!(c_dr_pc <= 0) || p_dw_pc <= 0) || !(1 == \old(q_free))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((2 <= c_dr_st || !(c_dr_pc <= 0)) || !(2 <= \old(c_dr_st))) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((!(p_last_write == q_buf_0) || (((c_last_read == p_last_write && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || ((0 == q_free && c_num_read + 1 == p_num_write) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(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)) && (((((((((!(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))) && ((((((((!(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)) || c_dr_pc <= 0) || !(1 == p_num_write)) || 1 == q_free) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 310]: 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) || ((((2 <= c_dr_st && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || (((((((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))) || !(1 == p_dw_i)) || (2 <= c_dr_st && c_dr_pc <= 0)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || ((((2 <= c_dr_st && c_num_read == p_num_write) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(\old(c_num_read) + 1 == \old(p_num_write))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 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)) || ((!(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)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) || (((((((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))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(\old(c_last_read) == \old(p_last_write))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 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))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || ((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(\old(c_num_read) == \old(p_num_write))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free) && p_last_write == q_buf_0)) || !(2 <= \old(c_dr_st))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && (((2 <= c_dr_st && c_dr_pc <= 0) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st)))) && ((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st))) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 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))) || !(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 == 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))) && ((2 <= c_dr_st || !(c_dr_pc <= 0)) || !(2 <= \old(c_dr_st))) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((!(c_dr_pc <= 0) || 0 == __retres1) || !(2 <= c_dr_st)) && (((((((!(c_dr_pc <= 0) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || !(c_num_read == p_num_write)) || !(1 == q_free)) || 0 == __retres1) || !(2 <= p_dw_st)) || !(c_last_read == p_last_write))) && (((((((!(c_dr_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(c_num_read == p_num_write)) || !(1 == q_free)) || 0 == __retres1) || !(c_last_read == p_last_write))) && (((((((!(p_dw_pc <= 0) || !(0 == c_num_read)) || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(1 == p_dw_i)) || !(1 == p_num_write)) || !(0 == q_free)) || 0 == __retres1) - 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))) || ((((2 <= c_dr_st && 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)) && ((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || (((2 <= c_dr_st && c_num_read == p_num_write) && 1 == q_free) && 2 <= p_dw_st)) || !(p_num_write == \old(c_num_read) + 1)) || ((((2 <= c_dr_st && c_last_read == p_last_write) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 == q_free)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: 1 - 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 == 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) || p_dw_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))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && ((((!(c_dr_pc <= 0) || p_dw_pc <= 0) || !(1 == \old(q_free))) || !(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))) && ((2 <= c_dr_st || !(c_dr_pc <= 0)) || !(2 <= \old(c_dr_st))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.0s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1859 SDtfs, 1885 SDslu, 1907 SDs, 0 SdLazy, 1548 SolverSat, 403 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1228 GetRequests, 1190 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2781occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 459 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3477 PreInvPairs, 3922 NumberOfFragments, 4748 HoareAnnotationTreeSize, 3477 FomulaSimplifications, 6886 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 45 FomulaSimplificationsInter, 14104 FormulaSimplificationTreeSizeReductionInter, 8.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1027 NumberOfCodeBlocks, 696 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1211 ConstructedInterpolants, 0 QuantifiedInterpolants, 224511 SizeOfPredicates, 16 NumberOfNonLiveVariables, 5350 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 292/336 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...