/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:27:55,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:27:55,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:27:55,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:27:55,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:27:55,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:27:55,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:27:55,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:27:55,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:27:55,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:27:55,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:27:55,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:27:55,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:27:55,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:27:55,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:27:55,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:27:55,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:27:55,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:27:55,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:27:55,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:27:55,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:27:55,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:27:55,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:27:55,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:27:55,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:27:55,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:27:55,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:27:55,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:27:55,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:27:55,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:27:55,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:27:55,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:27:55,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:27:55,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:27:55,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:27:55,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:27:55,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:27:55,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:27:55,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:27:55,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:27:55,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:27:55,269 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-11-09 15:27:55,316 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:27:55,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:27:55,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:27:55,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:27:55,318 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:27:55,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:27:55,319 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:27:55,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:27:55,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:27:55,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:27:55,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:27:55,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:27:55,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:27:55,321 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:27:55,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:27:55,321 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:27:55,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:27:55,322 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:27:55,322 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:27:55,322 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:27:55,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:27:55,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:27:55,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:27:55,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:27:55,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:27:55,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:27:55,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:27:55,324 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:27:55,325 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:27:55,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:27:55,325 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 15:27:55,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:27:55,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:27:55,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:27:55,705 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:27:55,706 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:27:55,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_tso.opt.i [2020-11-09 15:27:55,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc8f66d2/a2988c6abfeb439c8b8c9eb37e22350a/FLAGb7938616a [2020-11-09 15:27:56,548 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:27:56,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_tso.opt.i [2020-11-09 15:27:56,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc8f66d2/a2988c6abfeb439c8b8c9eb37e22350a/FLAGb7938616a [2020-11-09 15:27:56,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bc8f66d2/a2988c6abfeb439c8b8c9eb37e22350a [2020-11-09 15:27:56,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:27:56,807 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:27:56,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:27:56,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:27:56,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:27:56,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:27:56" (1/1) ... [2020-11-09 15:27:56,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5192ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:56, skipping insertion in model container [2020-11-09 15:27:56,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:27:56" (1/1) ... [2020-11-09 15:27:56,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:27:56,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:27:57,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:27:57,338 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:27:57,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:27:57,549 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:27:57,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:57 WrapperNode [2020-11-09 15:27:57,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:27:57,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:27:57,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:27:57,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:27:57,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:57" (1/1) ... [2020-11-09 15:27:57,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:57" (1/1) ... [2020-11-09 15:27:57,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:27:57,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:27:57,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:27:57,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:27:57,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:57" (1/1) ... [2020-11-09 15:27:57,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:57" (1/1) ... [2020-11-09 15:27:57,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:57" (1/1) ... [2020-11-09 15:27:57,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:57" (1/1) ... [2020-11-09 15:27:57,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:57" (1/1) ... [2020-11-09 15:27:57,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:57" (1/1) ... [2020-11-09 15:27:57,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:57" (1/1) ... [2020-11-09 15:27:57,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:27:57,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:27:57,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:27:57,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:27:57,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:57" (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-11-09 15:27:57,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:27:57,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:27:57,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:27:57,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:27:57,783 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 15:27:57,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 15:27:57,785 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 15:27:57,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 15:27:57,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:27:57,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:27:57,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:27:57,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:27:57,790 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 15:27:59,932 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:27:59,933 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 15:27:59,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:27:59 BoogieIcfgContainer [2020-11-09 15:27:59,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:27:59,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:27:59,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:27:59,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:27:59,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:27:56" (1/3) ... [2020-11-09 15:27:59,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f82361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:27:59, skipping insertion in model container [2020-11-09 15:27:59,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:27:57" (2/3) ... [2020-11-09 15:27:59,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f82361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:27:59, skipping insertion in model container [2020-11-09 15:27:59,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:27:59" (3/3) ... [2020-11-09 15:27:59,944 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi001_tso.opt.i [2020-11-09 15:27:59,961 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:27:59,961 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:27:59,965 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 15:27:59,966 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:27:59,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:59,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:59,998 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:59,998 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:59,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:59,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:59,999 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:27:59,999 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,004 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,004 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,005 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,005 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,005 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,006 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,007 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,008 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,011 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,011 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,011 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,011 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,011 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,011 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,017 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,017 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,021 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,021 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,022 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,023 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,023 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,023 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:00,025 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 15:28:00,044 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-09 15:28:00,067 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:28:00,067 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:28:00,067 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:28:00,067 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:28:00,067 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:28:00,067 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:28:00,068 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:28:00,068 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:28:00,080 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:28:00,081 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 88 transitions, 186 flow [2020-11-09 15:28:00,084 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 88 transitions, 186 flow [2020-11-09 15:28:00,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 92 places, 88 transitions, 186 flow [2020-11-09 15:28:00,129 INFO L129 PetriNetUnfolder]: 3/86 cut-off events. [2020-11-09 15:28:00,129 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 15:28:00,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 86 events. 3/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2020-11-09 15:28:00,136 INFO L116 LiptonReduction]: Number of co-enabled transitions 1182 [2020-11-09 15:28:00,490 WARN L194 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 15:28:01,163 WARN L194 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2020-11-09 15:28:01,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 15:28:01,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:01,577 WARN L194 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2020-11-09 15:28:01,954 WARN L194 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-09 15:28:03,547 WARN L194 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 15:28:03,747 WARN L194 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 15:28:05,838 WARN L194 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2020-11-09 15:28:05,976 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-11-09 15:28:06,297 WARN L194 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2020-11-09 15:28:06,484 WARN L194 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-11-09 15:28:06,704 WARN L194 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 15:28:06,871 WARN L194 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 15:28:07,061 WARN L194 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 15:28:07,246 WARN L194 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 15:28:07,252 INFO L131 LiptonReduction]: Checked pairs total: 3456 [2020-11-09 15:28:07,252 INFO L133 LiptonReduction]: Total number of compositions: 83 [2020-11-09 15:28:07,259 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 23 transitions, 56 flow [2020-11-09 15:28:07,281 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 257 states. [2020-11-09 15:28:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states. [2020-11-09 15:28:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 15:28:07,289 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:07,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 15:28:07,290 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:07,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:07,295 INFO L82 PathProgramCache]: Analyzing trace with hash 924053950, now seen corresponding path program 1 times [2020-11-09 15:28:07,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:07,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014368155] [2020-11-09 15:28:07,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:07,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014368155] [2020-11-09 15:28:07,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:07,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:28:07,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [579546862] [2020-11-09 15:28:07,583 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:07,587 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:07,599 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-11-09 15:28:07,600 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:07,604 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:28:07,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:28:07,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:07,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:28:07,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:28:07,620 INFO L87 Difference]: Start difference. First operand 257 states. Second operand 3 states. [2020-11-09 15:28:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:28:07,688 INFO L93 Difference]: Finished difference Result 222 states and 543 transitions. [2020-11-09 15:28:07,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:28:07,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-09 15:28:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:28:07,710 INFO L225 Difference]: With dead ends: 222 [2020-11-09 15:28:07,710 INFO L226 Difference]: Without dead ends: 162 [2020-11-09 15:28:07,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11-09 15:28:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-11-09 15:28:07,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-11-09 15:28:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-11-09 15:28:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 385 transitions. [2020-11-09 15:28:07,798 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 385 transitions. Word has length 5 [2020-11-09 15:28:07,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:28:07,798 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 385 transitions. [2020-11-09 15:28:07,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:28:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 385 transitions. [2020-11-09 15:28:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-09 15:28:07,799 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:07,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:28:07,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:28:07,799 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:07,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2047911184, now seen corresponding path program 1 times [2020-11-09 15:28:07,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:07,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108609353] [2020-11-09 15:28:07,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:08,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:08,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108609353] [2020-11-09 15:28:08,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:08,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:28:08,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [197819873] [2020-11-09 15:28:08,163 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:08,165 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:08,174 INFO L252 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-11-09 15:28:08,174 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:08,174 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:28:08,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:28:08,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:08,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:28:08,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:28:08,177 INFO L87 Difference]: Start difference. First operand 162 states and 385 transitions. Second operand 4 states. [2020-11-09 15:28:08,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:28:08,235 INFO L93 Difference]: Finished difference Result 172 states and 388 transitions. [2020-11-09 15:28:08,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:28:08,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-11-09 15:28:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:28:08,241 INFO L225 Difference]: With dead ends: 172 [2020-11-09 15:28:08,241 INFO L226 Difference]: Without dead ends: 142 [2020-11-09 15:28:08,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-11-09 15:28:08,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-09 15:28:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-11-09 15:28:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-09 15:28:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 329 transitions. [2020-11-09 15:28:08,259 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 329 transitions. Word has length 8 [2020-11-09 15:28:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:28:08,259 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 329 transitions. [2020-11-09 15:28:08,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:28:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 329 transitions. [2020-11-09 15:28:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 15:28:08,262 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:08,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:28:08,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:28:08,263 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:08,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:08,263 INFO L82 PathProgramCache]: Analyzing trace with hash -221891057, now seen corresponding path program 1 times [2020-11-09 15:28:08,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:08,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333351233] [2020-11-09 15:28:08,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:08,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333351233] [2020-11-09 15:28:08,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:08,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:28:08,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1271721041] [2020-11-09 15:28:08,492 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:08,494 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:08,498 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-11-09 15:28:08,498 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:08,504 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:28:08,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:08,505 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:28:08,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:08,590 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:28:08,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:28:08,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:08,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:28:08,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:28:08,592 INFO L87 Difference]: Start difference. First operand 142 states and 329 transitions. Second operand 6 states. [2020-11-09 15:28:08,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:28:08,682 INFO L93 Difference]: Finished difference Result 154 states and 340 transitions. [2020-11-09 15:28:08,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:28:08,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-09 15:28:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:28:08,684 INFO L225 Difference]: With dead ends: 154 [2020-11-09 15:28:08,684 INFO L226 Difference]: Without dead ends: 134 [2020-11-09 15:28:08,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:28:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-11-09 15:28:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-11-09 15:28:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-09 15:28:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 305 transitions. [2020-11-09 15:28:08,693 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 305 transitions. Word has length 10 [2020-11-09 15:28:08,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:28:08,693 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 305 transitions. [2020-11-09 15:28:08,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:28:08,693 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 305 transitions. [2020-11-09 15:28:08,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 15:28:08,695 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:08,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:28:08,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:28:08,695 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:08,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:08,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1731630508, now seen corresponding path program 1 times [2020-11-09 15:28:08,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:08,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619100889] [2020-11-09 15:28:08,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:08,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619100889] [2020-11-09 15:28:08,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:08,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:28:08,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [783852035] [2020-11-09 15:28:08,911 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:08,916 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:08,925 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 50 transitions. [2020-11-09 15:28:08,926 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:08,942 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:28:08,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:08,944 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:28:08,945 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:09,244 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2057#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$r_buff0_thd0~0 0))] [2020-11-09 15:28:09,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 15:28:09,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:09,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 15:28:09,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:28:09,246 INFO L87 Difference]: Start difference. First operand 134 states and 305 transitions. Second operand 8 states. [2020-11-09 15:28:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:28:09,471 INFO L93 Difference]: Finished difference Result 154 states and 338 transitions. [2020-11-09 15:28:09,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:28:09,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-11-09 15:28:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:28:09,475 INFO L225 Difference]: With dead ends: 154 [2020-11-09 15:28:09,475 INFO L226 Difference]: Without dead ends: 140 [2020-11-09 15:28:09,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:28:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-11-09 15:28:09,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2020-11-09 15:28:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-11-09 15:28:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 306 transitions. [2020-11-09 15:28:09,485 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 306 transitions. Word has length 12 [2020-11-09 15:28:09,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:28:09,485 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 306 transitions. [2020-11-09 15:28:09,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 15:28:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 306 transitions. [2020-11-09 15:28:09,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 15:28:09,487 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:09,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:28:09,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:28:09,487 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:09,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:09,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1512764304, now seen corresponding path program 1 times [2020-11-09 15:28:09,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:09,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291799362] [2020-11-09 15:28:09,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:09,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:09,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291799362] [2020-11-09 15:28:09,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:09,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:28:09,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [188887499] [2020-11-09 15:28:09,572 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:09,575 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:09,579 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 22 transitions. [2020-11-09 15:28:09,579 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:09,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:28:09,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:28:09,686 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2496#(not (= 2 ~__unbuffered_cnt~0))] [2020-11-09 15:28:09,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:28:09,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:09,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:28:09,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:28:09,687 INFO L87 Difference]: Start difference. First operand 136 states and 306 transitions. Second operand 5 states. [2020-11-09 15:28:09,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:28:09,764 INFO L93 Difference]: Finished difference Result 80 states and 159 transitions. [2020-11-09 15:28:09,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:28:09,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-09 15:28:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:28:09,765 INFO L225 Difference]: With dead ends: 80 [2020-11-09 15:28:09,765 INFO L226 Difference]: Without dead ends: 48 [2020-11-09 15:28:09,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:28:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-11-09 15:28:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2020-11-09 15:28:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-09 15:28:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2020-11-09 15:28:09,768 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 73 transitions. Word has length 12 [2020-11-09 15:28:09,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:28:09,769 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 73 transitions. [2020-11-09 15:28:09,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:28:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 73 transitions. [2020-11-09 15:28:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 15:28:09,771 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:09,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:28:09,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:28:09,772 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:09,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:09,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1621721203, now seen corresponding path program 1 times [2020-11-09 15:28:09,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:09,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205067008] [2020-11-09 15:28:09,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:09,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205067008] [2020-11-09 15:28:09,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:09,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:28:09,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [100503205] [2020-11-09 15:28:09,937 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:09,942 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:09,952 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 41 transitions. [2020-11-09 15:28:09,952 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:09,966 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:28:09,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:09,971 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:28:09,972 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:09,975 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:28:09,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:10,038 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:28:10,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:10,039 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:28:10,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:10,040 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:28:10,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:10,098 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:28:10,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:10,099 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:28:10,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:10,101 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:28:10,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:10,126 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:28:10,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:28:10,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:10,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:28:10,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:28:10,127 INFO L87 Difference]: Start difference. First operand 46 states and 73 transitions. Second operand 5 states. [2020-11-09 15:28:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:28:10,170 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2020-11-09 15:28:10,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:28:10,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-09 15:28:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:28:10,171 INFO L225 Difference]: With dead ends: 61 [2020-11-09 15:28:10,171 INFO L226 Difference]: Without dead ends: 26 [2020-11-09 15:28:10,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:28:10,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-11-09 15:28:10,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-11-09 15:28:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-11-09 15:28:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-11-09 15:28:10,174 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2020-11-09 15:28:10,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:28:10,175 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-11-09 15:28:10,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:28:10,175 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-11-09 15:28:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 15:28:10,175 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:10,176 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:28:10,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:28:10,176 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:10,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:10,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1475091489, now seen corresponding path program 2 times [2020-11-09 15:28:10,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:10,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430133178] [2020-11-09 15:28:10,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:10,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:10,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430133178] [2020-11-09 15:28:10,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:10,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 15:28:10,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [579862896] [2020-11-09 15:28:10,569 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:10,574 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:10,581 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 25 transitions. [2020-11-09 15:28:10,581 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:10,596 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:28:10,596 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:10,597 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:28:10,597 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:10,599 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:28:10,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:10,601 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:28:10,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:10,603 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:28:10,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:10,761 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:28:10,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:10,763 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 3, 3, 2, 2, 1] term [2020-11-09 15:28:10,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:10,764 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 6, 3, 2, 2, 1] term [2020-11-09 15:28:10,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:11,161 WARN L194 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 25 [2020-11-09 15:28:11,162 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2804#(and (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff0_thd1~0 0) (or (<= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (<= 0 ~y$w_buff0_used~0) (not (= (mod ~y$r_buff0_thd2~0 256) 0))) (or (<= ~y$w_buff0_used~0 0) (not (= (mod ~y$r_buff0_thd2~0 256) 0))) (= ~y$w_buff1_used~0 0) (or (<= 0 ~y$w_buff0_used~0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (= ~y$r_buff0_thd0~0 0))] [2020-11-09 15:28:11,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:28:11,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:11,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:28:11,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:28:11,163 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 10 states. [2020-11-09 15:28:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:28:11,341 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2020-11-09 15:28:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:28:11,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-11-09 15:28:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:28:11,342 INFO L225 Difference]: With dead ends: 35 [2020-11-09 15:28:11,342 INFO L226 Difference]: Without dead ends: 22 [2020-11-09 15:28:11,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:28:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-11-09 15:28:11,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-11-09 15:28:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-09 15:28:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-11-09 15:28:11,344 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2020-11-09 15:28:11,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:28:11,345 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-11-09 15:28:11,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:28:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-11-09 15:28:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 15:28:11,345 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:11,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:28:11,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:28:11,346 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:11,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:11,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1509559519, now seen corresponding path program 3 times [2020-11-09 15:28:11,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:11,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271488315] [2020-11-09 15:28:11,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:28:11,405 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:28:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:28:11,453 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:28:11,487 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 15:28:11,488 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 15:28:11,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 15:28:11,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:28:11 BasicIcfg [2020-11-09 15:28:11,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 15:28:11,562 INFO L168 Benchmark]: Toolchain (without parser) took 14764.78 ms. Allocated memory was 151.0 MB in the beginning and 291.5 MB in the end (delta: 140.5 MB). Free memory was 124.2 MB in the beginning and 130.9 MB in the end (delta: -6.7 MB). Peak memory consumption was 135.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:28:11,563 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 123.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:28:11,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.85 ms. Allocated memory is still 151.0 MB. Free memory was 123.6 MB in the beginning and 125.7 MB in the end (delta: -2.2 MB). Peak memory consumption was 31.7 MB. Max. memory is 8.0 GB. [2020-11-09 15:28:11,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.53 ms. Allocated memory is still 151.0 MB. Free memory was 125.7 MB in the beginning and 123.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:28:11,565 INFO L168 Benchmark]: Boogie Preprocessor took 38.17 ms. Allocated memory is still 151.0 MB. Free memory was 123.1 MB in the beginning and 121.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:28:11,566 INFO L168 Benchmark]: RCFGBuilder took 2244.78 ms. Allocated memory was 151.0 MB in the beginning and 196.1 MB in the end (delta: 45.1 MB). Free memory was 121.0 MB in the beginning and 155.2 MB in the end (delta: -34.2 MB). Peak memory consumption was 103.2 MB. Max. memory is 8.0 GB. [2020-11-09 15:28:11,567 INFO L168 Benchmark]: TraceAbstraction took 11623.66 ms. Allocated memory was 196.1 MB in the beginning and 291.5 MB in the end (delta: 95.4 MB). Free memory was 154.7 MB in the beginning and 130.9 MB in the end (delta: 23.8 MB). Peak memory consumption was 119.2 MB. Max. memory is 8.0 GB. [2020-11-09 15:28:11,571 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 123.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 741.85 ms. Allocated memory is still 151.0 MB. Free memory was 123.6 MB in the beginning and 125.7 MB in the end (delta: -2.2 MB). Peak memory consumption was 31.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 98.53 ms. Allocated memory is still 151.0 MB. Free memory was 125.7 MB in the beginning and 123.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 38.17 ms. Allocated memory is still 151.0 MB. Free memory was 123.1 MB in the beginning and 121.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2244.78 ms. Allocated memory was 151.0 MB in the beginning and 196.1 MB in the end (delta: 45.1 MB). Free memory was 121.0 MB in the beginning and 155.2 MB in the end (delta: -34.2 MB). Peak memory consumption was 103.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 11623.66 ms. Allocated memory was 196.1 MB in the beginning and 291.5 MB in the end (delta: 95.4 MB). Free memory was 154.7 MB in the beginning and 130.9 MB in the end (delta: 23.8 MB). Peak memory consumption was 119.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 634 VarBasedMoverChecksPositive, 20 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 55 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.1s, 92 PlacesBefore, 29 PlacesAfterwards, 88 TransitionsBefore, 23 TransitionsAfterwards, 1182 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, 3456 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1615; [L803] FCALL, FORK 0 pthread_create(&t1615, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t1616; [L805] FCALL, FORK 0 pthread_create(&t1616, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 2 z = 1 [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L746] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "rfi001_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 86 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.4s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 144 SDtfs, 149 SDslu, 276 SDs, 0 SdLazy, 167 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=257occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 7518 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...