/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-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 16:56:04,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 16:56:04,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 16:56:04,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 16:56:04,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 16:56:04,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 16:56:04,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 16:56:04,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 16:56:04,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 16:56:04,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 16:56:04,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 16:56:04,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 16:56:04,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 16:56:04,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 16:56:04,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 16:56:04,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 16:56:04,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 16:56:04,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 16:56:04,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 16:56:04,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 16:56:04,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 16:56:04,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 16:56:04,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 16:56:04,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 16:56:04,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 16:56:04,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 16:56:04,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 16:56:04,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 16:56:04,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 16:56:04,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 16:56:04,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 16:56:04,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 16:56:04,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 16:56:04,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 16:56:04,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 16:56:04,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 16:56:04,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 16:56:04,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 16:56:04,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 16:56:04,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 16:56:04,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 16:56:04,872 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-SP.epf [2020-11-09 16:56:04,920 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 16:56:04,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 16:56:04,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 16:56:04,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 16:56:04,924 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 16:56:04,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 16:56:04,925 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 16:56:04,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 16:56:04,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 16:56:04,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 16:56:04,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 16:56:04,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 16:56:04,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 16:56:04,927 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 16:56:04,927 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 16:56:04,927 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 16:56:04,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 16:56:04,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 16:56:04,928 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 16:56:04,928 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 16:56:04,928 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 16:56:04,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:56:04,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 16:56:04,929 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 16:56:04,929 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 16:56:04,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 16:56:04,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 16:56:04,929 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 16:56:04,930 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 16:56:04,930 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 16:56:04,930 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 16:56:05,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 16:56:05,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 16:56:05,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 16:56:05,324 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 16:56:05,324 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 16:56:05,325 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_tso.oepc.i [2020-11-09 16:56:05,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d079484/609accfde9b9466fb950d5791624783f/FLAG753437f47 [2020-11-09 16:56:06,060 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 16:56:06,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_tso.oepc.i [2020-11-09 16:56:06,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d079484/609accfde9b9466fb950d5791624783f/FLAG753437f47 [2020-11-09 16:56:06,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60d079484/609accfde9b9466fb950d5791624783f [2020-11-09 16:56:06,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 16:56:06,371 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 16:56:06,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 16:56:06,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 16:56:06,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 16:56:06,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:56:06" (1/1) ... [2020-11-09 16:56:06,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8d684c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:06, skipping insertion in model container [2020-11-09 16:56:06,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:56:06" (1/1) ... [2020-11-09 16:56:06,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 16:56:06,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 16:56:06,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:56:06,927 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 16:56:07,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:56:07,152 INFO L208 MainTranslator]: Completed translation [2020-11-09 16:56:07,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:07 WrapperNode [2020-11-09 16:56:07,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 16:56:07,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 16:56:07,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 16:56:07,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 16:56:07,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:07" (1/1) ... [2020-11-09 16:56:07,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:07" (1/1) ... [2020-11-09 16:56:07,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 16:56:07,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 16:56:07,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 16:56:07,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 16:56:07,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:07" (1/1) ... [2020-11-09 16:56:07,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:07" (1/1) ... [2020-11-09 16:56:07,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:07" (1/1) ... [2020-11-09 16:56:07,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:07" (1/1) ... [2020-11-09 16:56:07,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:07" (1/1) ... [2020-11-09 16:56:07,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:07" (1/1) ... [2020-11-09 16:56:07,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:07" (1/1) ... [2020-11-09 16:56:07,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 16:56:07,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 16:56:07,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 16:56:07,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 16:56:07,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:07" (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 16:56:07,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 16:56:07,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 16:56:07,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 16:56:07,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 16:56:07,364 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 16:56:07,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 16:56:07,365 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 16:56:07,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 16:56:07,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 16:56:07,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 16:56:07,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 16:56:07,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 16:56:07,367 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 16:56:09,422 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 16:56:09,423 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 16:56:09,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:56:09 BoogieIcfgContainer [2020-11-09 16:56:09,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 16:56:09,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 16:56:09,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 16:56:09,431 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 16:56:09,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:56:06" (1/3) ... [2020-11-09 16:56:09,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438b4296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:56:09, skipping insertion in model container [2020-11-09 16:56:09,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:56:07" (2/3) ... [2020-11-09 16:56:09,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438b4296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:56:09, skipping insertion in model container [2020-11-09 16:56:09,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:56:09" (3/3) ... [2020-11-09 16:56:09,434 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi001_tso.oepc.i [2020-11-09 16:56:09,450 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 16:56:09,451 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 16:56:09,455 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 16:56:09,455 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 16:56:09,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,487 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,487 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,488 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,489 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,494 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,494 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,494 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,494 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,495 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,495 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,496 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,498 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,506 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,506 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,509 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:56:09,513 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 16:56:09,526 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-09 16:56:09,548 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 16:56:09,549 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 16:56:09,549 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 16:56:09,549 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 16:56:09,549 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 16:56:09,549 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 16:56:09,549 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 16:56:09,550 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 16:56:09,562 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 16:56:09,562 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 88 transitions, 186 flow [2020-11-09 16:56:09,565 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 88 transitions, 186 flow [2020-11-09 16:56:09,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 92 places, 88 transitions, 186 flow [2020-11-09 16:56:09,619 INFO L129 PetriNetUnfolder]: 3/86 cut-off events. [2020-11-09 16:56:09,619 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 16:56:09,624 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 16:56:09,629 INFO L116 LiptonReduction]: Number of co-enabled transitions 1182 [2020-11-09 16:56:10,024 WARN L194 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 16:56:10,145 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-09 16:56:10,748 WARN L194 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2020-11-09 16:56:10,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 16:56:10,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:56:11,271 WARN L194 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2020-11-09 16:56:11,449 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-11-09 16:56:11,557 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-11-09 16:56:11,711 WARN L194 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-09 16:56:13,229 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 16:56:13,355 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 16:56:13,571 WARN L194 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 16:56:13,793 WARN L194 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-09 16:56:14,553 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-11-09 16:56:15,622 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-09 16:56:15,729 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-09 16:56:15,841 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-11-09 16:56:16,333 WARN L194 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2020-11-09 16:56:16,530 WARN L194 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-11-09 16:56:16,939 WARN L194 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2020-11-09 16:56:17,125 WARN L194 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-11-09 16:56:17,383 WARN L194 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 16:56:17,638 WARN L194 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 16:56:17,854 WARN L194 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 16:56:18,063 WARN L194 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 16:56:18,069 INFO L131 LiptonReduction]: Checked pairs total: 3456 [2020-11-09 16:56:18,069 INFO L133 LiptonReduction]: Total number of compositions: 83 [2020-11-09 16:56:18,082 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 23 transitions, 56 flow [2020-11-09 16:56:18,103 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 257 states. [2020-11-09 16:56:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states. [2020-11-09 16:56:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 16:56:18,110 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:56:18,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 16:56:18,111 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:56:18,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:56:18,115 INFO L82 PathProgramCache]: Analyzing trace with hash 924053950, now seen corresponding path program 1 times [2020-11-09 16:56:18,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:56:18,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569647130] [2020-11-09 16:56:18,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:56:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:56:18,417 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 16:56:18,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569647130] [2020-11-09 16:56:18,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:56:18,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:56:18,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [519651189] [2020-11-09 16:56:18,421 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:56:18,424 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:56:18,438 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-11-09 16:56:18,438 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:56:18,442 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:56:18,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:56:18,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:56:18,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:56:18,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:56:18,457 INFO L87 Difference]: Start difference. First operand 257 states. Second operand 3 states. [2020-11-09 16:56:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:56:18,517 INFO L93 Difference]: Finished difference Result 222 states and 543 transitions. [2020-11-09 16:56:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:56:18,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-09 16:56:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:56:18,531 INFO L225 Difference]: With dead ends: 222 [2020-11-09 16:56:18,531 INFO L226 Difference]: Without dead ends: 162 [2020-11-09 16:56:18,533 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 16:56:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-11-09 16:56:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-11-09 16:56:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-11-09 16:56:18,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 385 transitions. [2020-11-09 16:56:18,590 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 385 transitions. Word has length 5 [2020-11-09 16:56:18,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:56:18,590 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 385 transitions. [2020-11-09 16:56:18,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:56:18,591 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 385 transitions. [2020-11-09 16:56:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-09 16:56:18,592 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:56:18,592 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:56:18,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 16:56:18,593 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:56:18,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:56:18,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2047911184, now seen corresponding path program 1 times [2020-11-09 16:56:18,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:56:18,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604979720] [2020-11-09 16:56:18,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:56:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:56:18,944 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 16:56:18,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604979720] [2020-11-09 16:56:18,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:56:18,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:56:18,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [282146991] [2020-11-09 16:56:18,949 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:56:18,952 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:56:18,959 INFO L252 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-11-09 16:56:18,959 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:56:18,959 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:56:18,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:56:18,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:56:18,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:56:18,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:56:18,965 INFO L87 Difference]: Start difference. First operand 162 states and 385 transitions. Second operand 5 states. [2020-11-09 16:56:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:56:19,086 INFO L93 Difference]: Finished difference Result 188 states and 424 transitions. [2020-11-09 16:56:19,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:56:19,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-11-09 16:56:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:56:19,089 INFO L225 Difference]: With dead ends: 188 [2020-11-09 16:56:19,089 INFO L226 Difference]: Without dead ends: 158 [2020-11-09 16:56:19,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:56:19,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-11-09 16:56:19,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-11-09 16:56:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-11-09 16:56:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 373 transitions. [2020-11-09 16:56:19,107 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 373 transitions. Word has length 8 [2020-11-09 16:56:19,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:56:19,107 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 373 transitions. [2020-11-09 16:56:19,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:56:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 373 transitions. [2020-11-09 16:56:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 16:56:19,109 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:56:19,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:56:19,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 16:56:19,109 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:56:19,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:56:19,110 INFO L82 PathProgramCache]: Analyzing trace with hash -976991191, now seen corresponding path program 1 times [2020-11-09 16:56:19,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:56:19,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648145805] [2020-11-09 16:56:19,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:56:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:56:19,226 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 16:56:19,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648145805] [2020-11-09 16:56:19,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:56:19,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:56:19,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1986305490] [2020-11-09 16:56:19,228 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:56:19,231 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:56:19,258 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 11 transitions. [2020-11-09 16:56:19,258 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:56:19,290 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:56:19,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:56:19,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:56:19,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:56:19,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:56:19,292 INFO L87 Difference]: Start difference. First operand 158 states and 373 transitions. Second operand 4 states. [2020-11-09 16:56:19,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:56:19,328 INFO L93 Difference]: Finished difference Result 170 states and 382 transitions. [2020-11-09 16:56:19,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:56:19,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-11-09 16:56:19,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:56:19,332 INFO L225 Difference]: With dead ends: 170 [2020-11-09 16:56:19,332 INFO L226 Difference]: Without dead ends: 142 [2020-11-09 16:56:19,332 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 16:56:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-11-09 16:56:19,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-11-09 16:56:19,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-11-09 16:56:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 329 transitions. [2020-11-09 16:56:19,344 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 329 transitions. Word has length 9 [2020-11-09 16:56:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:56:19,345 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 329 transitions. [2020-11-09 16:56:19,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:56:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 329 transitions. [2020-11-09 16:56:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 16:56:19,346 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:56:19,347 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:56:19,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 16:56:19,347 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:56:19,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:56:19,348 INFO L82 PathProgramCache]: Analyzing trace with hash -221891057, now seen corresponding path program 1 times [2020-11-09 16:56:19,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:56:19,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104584501] [2020-11-09 16:56:19,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:56:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:56:19,523 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 16:56:19,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104584501] [2020-11-09 16:56:19,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:56:19,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:56:19,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1607967292] [2020-11-09 16:56:19,524 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:56:19,527 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:56:19,530 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-11-09 16:56:19,531 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:56:19,546 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:56:19,547 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:19,550 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:56:19,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:19,553 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:56:19,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:19,681 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2134#(and (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff0_thd0~0 0)) (or (= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= ~y~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))))] [2020-11-09 16:56:19,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 16:56:19,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:56:19,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 16:56:19,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-09 16:56:19,682 INFO L87 Difference]: Start difference. First operand 142 states and 329 transitions. Second operand 6 states. [2020-11-09 16:56:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:56:19,939 INFO L93 Difference]: Finished difference Result 181 states and 409 transitions. [2020-11-09 16:56:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:56:19,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-11-09 16:56:19,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:56:19,945 INFO L225 Difference]: With dead ends: 181 [2020-11-09 16:56:19,945 INFO L226 Difference]: Without dead ends: 161 [2020-11-09 16:56:19,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-11-09 16:56:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-11-09 16:56:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 134. [2020-11-09 16:56:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-09 16:56:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 305 transitions. [2020-11-09 16:56:19,964 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 305 transitions. Word has length 10 [2020-11-09 16:56:19,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:56:19,964 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 305 transitions. [2020-11-09 16:56:19,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 16:56:19,964 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 305 transitions. [2020-11-09 16:56:19,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 16:56:19,969 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:56:19,969 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:56:19,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 16:56:19,969 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:56:19,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:56:19,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1731630508, now seen corresponding path program 1 times [2020-11-09 16:56:19,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:56:19,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742734260] [2020-11-09 16:56:19,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:56:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:56:20,207 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 16:56:20,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742734260] [2020-11-09 16:56:20,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:56:20,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:56:20,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [670868124] [2020-11-09 16:56:20,210 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:56:20,214 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:56:20,221 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 50 transitions. [2020-11-09 16:56:20,221 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:56:20,233 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:56:20,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:20,236 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:56:20,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:20,700 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [2597#(and (= ~y~0 1) (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff1~0 1) (= (mod ~y$w_buff1_used~0 256) 0)) (not (= 2 ~y$w_buff1~0))), 2598#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y$w_buff1~0 1) (= (mod ~y$w_buff1_used~0 256) 0)) (not (= 2 ~y$w_buff1~0))), 2599#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)))] [2020-11-09 16:56:20,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 16:56:20,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:56:20,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 16:56:20,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-09 16:56:20,702 INFO L87 Difference]: Start difference. First operand 134 states and 305 transitions. Second operand 10 states. [2020-11-09 16:56:20,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:56:20,954 INFO L93 Difference]: Finished difference Result 154 states and 338 transitions. [2020-11-09 16:56:20,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 16:56:20,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2020-11-09 16:56:20,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:56:20,958 INFO L225 Difference]: With dead ends: 154 [2020-11-09 16:56:20,958 INFO L226 Difference]: Without dead ends: 140 [2020-11-09 16:56:20,959 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-11-09 16:56:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-11-09 16:56:20,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2020-11-09 16:56:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-11-09 16:56:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 306 transitions. [2020-11-09 16:56:20,967 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 306 transitions. Word has length 12 [2020-11-09 16:56:20,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:56:20,968 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 306 transitions. [2020-11-09 16:56:20,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 16:56:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 306 transitions. [2020-11-09 16:56:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 16:56:20,977 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:56:20,977 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:56:20,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 16:56:20,977 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:56:20,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:56:20,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1512764304, now seen corresponding path program 1 times [2020-11-09 16:56:20,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:56:20,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033958280] [2020-11-09 16:56:20,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:56:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:56:21,070 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 16:56:21,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033958280] [2020-11-09 16:56:21,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:56:21,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:56:21,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2023297295] [2020-11-09 16:56:21,072 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:56:21,074 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:56:21,078 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 22 transitions. [2020-11-09 16:56:21,079 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:56:21,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:56:21,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:56:21,200 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3038#(not (= 2 ~__unbuffered_cnt~0))] [2020-11-09 16:56:21,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:56:21,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:56:21,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:56:21,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:56:21,201 INFO L87 Difference]: Start difference. First operand 136 states and 306 transitions. Second operand 5 states. [2020-11-09 16:56:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:56:21,259 INFO L93 Difference]: Finished difference Result 80 states and 159 transitions. [2020-11-09 16:56:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:56:21,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-09 16:56:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:56:21,261 INFO L225 Difference]: With dead ends: 80 [2020-11-09 16:56:21,261 INFO L226 Difference]: Without dead ends: 48 [2020-11-09 16:56:21,262 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 16:56:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-11-09 16:56:21,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2020-11-09 16:56:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-09 16:56:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2020-11-09 16:56:21,265 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 73 transitions. Word has length 12 [2020-11-09 16:56:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:56:21,265 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 73 transitions. [2020-11-09 16:56:21,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:56:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 73 transitions. [2020-11-09 16:56:21,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 16:56:21,266 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:56:21,266 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 16:56:21,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 16:56:21,266 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:56:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:56:21,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1621721203, now seen corresponding path program 1 times [2020-11-09 16:56:21,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:56:21,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694336890] [2020-11-09 16:56:21,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:56:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:56:21,406 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 16:56:21,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694336890] [2020-11-09 16:56:21,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:56:21,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:56:21,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [705049865] [2020-11-09 16:56:21,408 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:56:21,413 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:56:21,422 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 41 transitions. [2020-11-09 16:56:21,422 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:56:21,434 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:56:21,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:21,437 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:56:21,438 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:21,440 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:56:21,441 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:21,537 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:56:21,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:21,539 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:56:21,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:21,540 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:56:21,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:21,576 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:56:21,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:21,577 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:56:21,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:21,581 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:56:21,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:21,619 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:56:21,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:56:21,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:56:21,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:56:21,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:56:21,621 INFO L87 Difference]: Start difference. First operand 46 states and 73 transitions. Second operand 5 states. [2020-11-09 16:56:21,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:56:21,669 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2020-11-09 16:56:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:56:21,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-09 16:56:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:56:21,670 INFO L225 Difference]: With dead ends: 61 [2020-11-09 16:56:21,670 INFO L226 Difference]: Without dead ends: 26 [2020-11-09 16:56:21,670 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 16:56:21,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-11-09 16:56:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-11-09 16:56:21,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-11-09 16:56:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-11-09 16:56:21,674 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2020-11-09 16:56:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:56:21,674 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-11-09 16:56:21,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:56:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-11-09 16:56:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 16:56:21,675 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:56:21,675 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 16:56:21,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 16:56:21,675 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:56:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:56:21,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1475091489, now seen corresponding path program 2 times [2020-11-09 16:56:21,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:56:21,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189231123] [2020-11-09 16:56:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:56:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:56:22,074 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 16:56:22,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189231123] [2020-11-09 16:56:22,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:56:22,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 16:56:22,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [932501176] [2020-11-09 16:56:22,075 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:56:22,085 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:56:22,094 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 25 transitions. [2020-11-09 16:56:22,094 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:56:22,101 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 16:56:22,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:22,102 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:56:22,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:22,107 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:56:22,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:22,109 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:56:22,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:22,111 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:56:22,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:22,178 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:56:22,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:22,180 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:56:22,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:56:22,181 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 5, 3, 2, 2, 1] term [2020-11-09 16:56:22,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:56:22,377 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3345#(and (= ~y$r_buff1_thd0~0 0) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= 0 (div ~y$w_buff0_used~0 256))) (or (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~y$r_buff1_thd1~0 0) (= ~y$r_buff0_thd0~0 0))] [2020-11-09 16:56:22,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 16:56:22,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:56:22,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 16:56:22,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-09 16:56:22,379 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 9 states. [2020-11-09 16:56:22,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:56:22,617 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2020-11-09 16:56:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:56:22,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2020-11-09 16:56:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:56:22,619 INFO L225 Difference]: With dead ends: 35 [2020-11-09 16:56:22,619 INFO L226 Difference]: Without dead ends: 22 [2020-11-09 16:56:22,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-09 16:56:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-11-09 16:56:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-11-09 16:56:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-11-09 16:56:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-11-09 16:56:22,621 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2020-11-09 16:56:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:56:22,621 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-11-09 16:56:22,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 16:56:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2020-11-09 16:56:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 16:56:22,622 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:56:22,622 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 16:56:22,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 16:56:22,622 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:56:22,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:56:22,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1509559519, now seen corresponding path program 3 times [2020-11-09 16:56:22,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:56:22,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303031450] [2020-11-09 16:56:22,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:56:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:56:22,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:56:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:56:22,735 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:56:22,774 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 16:56:22,775 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 16:56:22,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 16:56:22,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:56:22 BasicIcfg [2020-11-09 16:56:22,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 16:56:22,851 INFO L168 Benchmark]: Toolchain (without parser) took 16483.92 ms. Allocated memory was 151.0 MB in the beginning and 273.7 MB in the end (delta: 122.7 MB). Free memory was 125.2 MB in the beginning and 122.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 126.9 MB. Max. memory is 8.0 GB. [2020-11-09 16:56:22,852 INFO L168 Benchmark]: CDTParser took 0.70 ms. Allocated memory is still 151.0 MB. Free memory is still 121.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 16:56:22,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.60 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 128.9 MB in the end (delta: -4.4 MB). Peak memory consumption was 34.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:56:22,853 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.92 ms. Allocated memory is still 151.0 MB. Free memory was 128.9 MB in the beginning and 126.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:56:22,854 INFO L168 Benchmark]: Boogie Preprocessor took 65.47 ms. Allocated memory is still 151.0 MB. Free memory was 126.3 MB in the beginning and 124.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:56:22,856 INFO L168 Benchmark]: RCFGBuilder took 2135.04 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 124.2 MB in the beginning and 134.7 MB in the end (delta: -10.5 MB). Peak memory consumption was 98.0 MB. Max. memory is 8.0 GB. [2020-11-09 16:56:22,857 INFO L168 Benchmark]: TraceAbstraction took 13421.83 ms. Allocated memory was 181.4 MB in the beginning and 273.7 MB in the end (delta: 92.3 MB). Free memory was 134.2 MB in the beginning and 122.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 104.4 MB. Max. memory is 8.0 GB. [2020-11-09 16:56:22,862 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.70 ms. Allocated memory is still 151.0 MB. Free memory is still 121.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 783.60 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 128.9 MB in the end (delta: -4.4 MB). Peak memory consumption was 34.1 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 65.92 ms. Allocated memory is still 151.0 MB. Free memory was 128.9 MB in the beginning and 126.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 65.47 ms. Allocated memory is still 151.0 MB. Free memory was 126.3 MB in the beginning and 124.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2135.04 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 124.2 MB in the beginning and 134.7 MB in the end (delta: -10.5 MB). Peak memory consumption was 98.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13421.83 ms. Allocated memory was 181.4 MB in the beginning and 273.7 MB in the end (delta: 92.3 MB). Free memory was 134.2 MB in the beginning and 122.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 104.4 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: 8.5s, 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 t1613; [L803] FCALL, FORK 0 pthread_create(&t1613, ((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 t1614; [L805] FCALL, FORK 0 pthread_create(&t1614, ((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.oepc.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: 13.2s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 167 SDtfs, 190 SDslu, 333 SDs, 0 SdLazy, 211 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s 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, 8 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 7634 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...