/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 00:47:40,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 00:47:40,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 00:47:40,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 00:47:40,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 00:47:40,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 00:47:40,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 00:47:40,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 00:47:40,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 00:47:40,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 00:47:40,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 00:47:40,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 00:47:40,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 00:47:40,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 00:47:40,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 00:47:40,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 00:47:40,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 00:47:40,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 00:47:40,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 00:47:40,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 00:47:40,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 00:47:40,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 00:47:40,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 00:47:40,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 00:47:40,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 00:47:40,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 00:47:40,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 00:47:40,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 00:47:40,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 00:47:40,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 00:47:40,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 00:47:40,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 00:47:40,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 00:47:40,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 00:47:40,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 00:47:40,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 00:47:40,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 00:47:40,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 00:47:40,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 00:47:40,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 00:47:40,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 00:47:40,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-06 00:47:40,957 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 00:47:40,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 00:47:40,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 00:47:40,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 00:47:40,959 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 00:47:40,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 00:47:40,959 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 00:47:40,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 00:47:40,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 00:47:40,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 00:47:40,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 00:47:40,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 00:47:40,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 00:47:40,961 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 00:47:40,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 00:47:40,961 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 00:47:40,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 00:47:40,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 00:47:40,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 00:47:40,962 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 00:47:40,962 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 00:47:40,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:47:40,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 00:47:40,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 00:47:40,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 00:47:40,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 00:47:40,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 00:47:40,964 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 00:47:40,964 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 00:47:40,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 00:47:40,964 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 00:47:41,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 00:47:41,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 00:47:41,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 00:47:41,278 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 00:47:41,279 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 00:47:41,281 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i [2020-10-06 00:47:41,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56257c3cb/225070d27ceb4caca20bf58f375abb40/FLAG8670d9f0d [2020-10-06 00:47:41,914 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 00:47:41,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i [2020-10-06 00:47:41,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56257c3cb/225070d27ceb4caca20bf58f375abb40/FLAG8670d9f0d [2020-10-06 00:47:42,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56257c3cb/225070d27ceb4caca20bf58f375abb40 [2020-10-06 00:47:42,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 00:47:42,195 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 00:47:42,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 00:47:42,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 00:47:42,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 00:47:42,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:47:42" (1/1) ... [2020-10-06 00:47:42,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc2befc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:42, skipping insertion in model container [2020-10-06 00:47:42,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:47:42" (1/1) ... [2020-10-06 00:47:42,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 00:47:42,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 00:47:42,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:47:42,876 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 00:47:42,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:47:43,025 INFO L208 MainTranslator]: Completed translation [2020-10-06 00:47:43,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:43 WrapperNode [2020-10-06 00:47:43,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 00:47:43,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 00:47:43,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 00:47:43,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 00:47:43,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:43" (1/1) ... [2020-10-06 00:47:43,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:43" (1/1) ... [2020-10-06 00:47:43,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 00:47:43,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 00:47:43,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 00:47:43,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 00:47:43,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:43" (1/1) ... [2020-10-06 00:47:43,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:43" (1/1) ... [2020-10-06 00:47:43,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:43" (1/1) ... [2020-10-06 00:47:43,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:43" (1/1) ... [2020-10-06 00:47:43,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:43" (1/1) ... [2020-10-06 00:47:43,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:43" (1/1) ... [2020-10-06 00:47:43,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:43" (1/1) ... [2020-10-06 00:47:43,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 00:47:43,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 00:47:43,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 00:47:43,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 00:47:43,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:43" (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-10-06 00:47:43,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 00:47:43,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 00:47:43,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 00:47:43,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 00:47:43,228 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 00:47:43,228 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 00:47:43,228 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 00:47:43,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 00:47:43,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 00:47:43,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 00:47:43,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 00:47:43,232 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 00:47:45,247 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 00:47:45,248 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 00:47:45,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:47:45 BoogieIcfgContainer [2020-10-06 00:47:45,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 00:47:45,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 00:47:45,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 00:47:45,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 00:47:45,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 12:47:42" (1/3) ... [2020-10-06 00:47:45,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7298028e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:47:45, skipping insertion in model container [2020-10-06 00:47:45,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:47:43" (2/3) ... [2020-10-06 00:47:45,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7298028e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:47:45, skipping insertion in model container [2020-10-06 00:47:45,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:47:45" (3/3) ... [2020-10-06 00:47:45,260 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_tso.opt.i [2020-10-06 00:47:45,271 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 00:47:45,271 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 00:47:45,279 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 00:47:45,280 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 00:47:45,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,309 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,309 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,313 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,313 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,319 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,320 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,321 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,321 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,324 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,325 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,325 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:47:45,343 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-06 00:47:45,365 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 00:47:45,365 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 00:47:45,366 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 00:47:45,366 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 00:47:45,366 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 00:47:45,366 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 00:47:45,366 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 00:47:45,366 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 00:47:45,383 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 75 transitions, 160 flow [2020-10-06 00:47:45,385 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-06 00:47:45,426 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-06 00:47:45,427 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:47:45,432 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-06 00:47:45,434 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-06 00:47:45,457 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-06 00:47:45,457 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:47:45,458 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-06 00:47:45,462 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 888 [2020-10-06 00:47:45,463 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 00:47:45,758 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-10-06 00:47:47,183 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-06 00:47:47,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-06 00:47:47,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:47:47,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-06 00:47:47,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:47:48,001 WARN L193 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-06 00:47:48,521 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-06 00:47:48,639 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-06 00:47:49,337 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-10-06 00:47:49,432 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2408 [2020-10-06 00:47:49,433 INFO L214 etLargeBlockEncoding]: Total number of compositions: 64 [2020-10-06 00:47:49,436 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2020-10-06 00:47:49,456 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 222 states. [2020-10-06 00:47:49,458 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states. [2020-10-06 00:47:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-06 00:47:49,465 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:49,466 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-06 00:47:49,467 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:49,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:49,473 INFO L82 PathProgramCache]: Analyzing trace with hash 861621042, now seen corresponding path program 1 times [2020-10-06 00:47:49,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:49,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952322958] [2020-10-06 00:47:49,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:49,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952322958] [2020-10-06 00:47:49,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:49,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:47:49,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [316105382] [2020-10-06 00:47:49,718 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:49,721 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:49,734 INFO L258 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-06 00:47:49,735 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:49,739 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:49,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:47:49,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:49,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:47:49,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:47:49,759 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 3 states. [2020-10-06 00:47:49,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:49,819 INFO L93 Difference]: Finished difference Result 187 states and 450 transitions. [2020-10-06 00:47:49,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:47:49,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-06 00:47:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:49,836 INFO L225 Difference]: With dead ends: 187 [2020-10-06 00:47:49,836 INFO L226 Difference]: Without dead ends: 137 [2020-10-06 00:47:49,837 INFO L675 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-10-06 00:47:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-06 00:47:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-06 00:47:49,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-06 00:47:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 320 transitions. [2020-10-06 00:47:49,888 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 320 transitions. Word has length 5 [2020-10-06 00:47:49,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:49,888 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 320 transitions. [2020-10-06 00:47:49,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:47:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 320 transitions. [2020-10-06 00:47:49,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-06 00:47:49,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:49,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:49,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 00:47:49,891 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:49,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:49,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1829495527, now seen corresponding path program 1 times [2020-10-06 00:47:49,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:49,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268198416] [2020-10-06 00:47:49,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:50,108 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268198416] [2020-10-06 00:47:50,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:50,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:47:50,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1947688709] [2020-10-06 00:47:50,109 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:50,110 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:50,113 INFO L258 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-10-06 00:47:50,113 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:50,113 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:50,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:47:50,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:50,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:47:50,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:47:50,116 INFO L87 Difference]: Start difference. First operand 137 states and 320 transitions. Second operand 5 states. [2020-10-06 00:47:50,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:50,245 INFO L93 Difference]: Finished difference Result 152 states and 337 transitions. [2020-10-06 00:47:50,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:47:50,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-06 00:47:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:50,249 INFO L225 Difference]: With dead ends: 152 [2020-10-06 00:47:50,250 INFO L226 Difference]: Without dead ends: 127 [2020-10-06 00:47:50,251 INFO L675 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-10-06 00:47:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-06 00:47:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-10-06 00:47:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-06 00:47:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 292 transitions. [2020-10-06 00:47:50,266 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 292 transitions. Word has length 8 [2020-10-06 00:47:50,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:50,266 INFO L479 AbstractCegarLoop]: Abstraction has 127 states and 292 transitions. [2020-10-06 00:47:50,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:47:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 292 transitions. [2020-10-06 00:47:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 00:47:50,268 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:50,268 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:50,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 00:47:50,268 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:50,269 INFO L82 PathProgramCache]: Analyzing trace with hash 879762521, now seen corresponding path program 1 times [2020-10-06 00:47:50,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:50,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831962277] [2020-10-06 00:47:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:50,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831962277] [2020-10-06 00:47:50,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:50,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:47:50,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [391201408] [2020-10-06 00:47:50,406 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:50,407 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:50,409 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 00:47:50,410 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:50,410 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:50,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:47:50,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:50,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:47:50,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:47:50,411 INFO L87 Difference]: Start difference. First operand 127 states and 292 transitions. Second operand 6 states. [2020-10-06 00:47:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:50,584 INFO L93 Difference]: Finished difference Result 135 states and 293 transitions. [2020-10-06 00:47:50,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:47:50,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-06 00:47:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:50,586 INFO L225 Difference]: With dead ends: 135 [2020-10-06 00:47:50,586 INFO L226 Difference]: Without dead ends: 115 [2020-10-06 00:47:50,588 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:47:50,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-10-06 00:47:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2020-10-06 00:47:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-10-06 00:47:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 256 transitions. [2020-10-06 00:47:50,611 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 256 transitions. Word has length 9 [2020-10-06 00:47:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:50,611 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 256 transitions. [2020-10-06 00:47:50,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:47:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 256 transitions. [2020-10-06 00:47:50,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 00:47:50,616 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:50,616 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:50,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 00:47:50,616 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:50,617 INFO L82 PathProgramCache]: Analyzing trace with hash -657848166, now seen corresponding path program 1 times [2020-10-06 00:47:50,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:50,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327422639] [2020-10-06 00:47:50,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:50,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327422639] [2020-10-06 00:47:50,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:50,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:47:50,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [883818207] [2020-10-06 00:47:50,749 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:50,751 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:50,753 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-06 00:47:50,754 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:50,754 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:50,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:47:50,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:50,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:47:50,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:47:50,755 INFO L87 Difference]: Start difference. First operand 115 states and 256 transitions. Second operand 4 states. [2020-10-06 00:47:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:50,778 INFO L93 Difference]: Finished difference Result 96 states and 180 transitions. [2020-10-06 00:47:50,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:47:50,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-06 00:47:50,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:50,780 INFO L225 Difference]: With dead ends: 96 [2020-10-06 00:47:50,780 INFO L226 Difference]: Without dead ends: 71 [2020-10-06 00:47:50,781 INFO L675 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-10-06 00:47:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-06 00:47:50,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-06 00:47:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-06 00:47:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 124 transitions. [2020-10-06 00:47:50,786 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 124 transitions. Word has length 11 [2020-10-06 00:47:50,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:50,786 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 124 transitions. [2020-10-06 00:47:50,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:47:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 124 transitions. [2020-10-06 00:47:50,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 00:47:50,788 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:50,788 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:50,788 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 00:47:50,788 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:50,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:50,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1314571888, now seen corresponding path program 1 times [2020-10-06 00:47:50,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:50,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287495559] [2020-10-06 00:47:50,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:50,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287495559] [2020-10-06 00:47:50,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:50,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:47:50,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1479322082] [2020-10-06 00:47:50,952 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:50,954 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:50,957 INFO L258 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2020-10-06 00:47:50,957 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:50,958 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:50,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:47:50,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:50,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:47:50,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:47:50,959 INFO L87 Difference]: Start difference. First operand 71 states and 124 transitions. Second operand 5 states. [2020-10-06 00:47:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:50,996 INFO L93 Difference]: Finished difference Result 50 states and 80 transitions. [2020-10-06 00:47:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:47:50,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-06 00:47:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:50,997 INFO L225 Difference]: With dead ends: 50 [2020-10-06 00:47:50,997 INFO L226 Difference]: Without dead ends: 41 [2020-10-06 00:47:50,998 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:47:50,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-06 00:47:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-06 00:47:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-06 00:47:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2020-10-06 00:47:51,001 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 12 [2020-10-06 00:47:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:51,002 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2020-10-06 00:47:51,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:47:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2020-10-06 00:47:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 00:47:51,003 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:51,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:51,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 00:47:51,004 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:51,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:51,004 INFO L82 PathProgramCache]: Analyzing trace with hash -299715963, now seen corresponding path program 1 times [2020-10-06 00:47:51,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:51,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982804327] [2020-10-06 00:47:51,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:51,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982804327] [2020-10-06 00:47:51,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:51,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:47:51,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1810455856] [2020-10-06 00:47:51,165 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:51,170 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:51,178 INFO L258 McrAutomatonBuilder]: Finished intersection with 28 states and 38 transitions. [2020-10-06 00:47:51,178 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:51,211 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:47:51,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,216 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:47:51,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,352 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:47:51,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,359 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:47:51,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,430 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:47:51,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,441 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:47:51,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:47:51,462 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:51,475 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:51,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:47:51,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:51,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:47:51,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:47:51,476 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand 7 states. [2020-10-06 00:47:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:51,588 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2020-10-06 00:47:51,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:47:51,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-06 00:47:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:51,590 INFO L225 Difference]: With dead ends: 60 [2020-10-06 00:47:51,590 INFO L226 Difference]: Without dead ends: 29 [2020-10-06 00:47:51,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:47:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-06 00:47:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-06 00:47:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-06 00:47:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-10-06 00:47:51,594 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 16 [2020-10-06 00:47:51,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:51,594 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-10-06 00:47:51,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:47:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-10-06 00:47:51,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 00:47:51,595 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:51,595 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:51,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 00:47:51,596 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:51,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:51,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1056418205, now seen corresponding path program 2 times [2020-10-06 00:47:51,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:51,601 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530995826] [2020-10-06 00:47:51,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:51,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530995826] [2020-10-06 00:47:51,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:51,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:47:51,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [722626648] [2020-10-06 00:47:51,730 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:51,733 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:51,740 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 26 transitions. [2020-10-06 00:47:51,740 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:51,793 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:51,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:47:51,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:51,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:47:51,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:47:51,794 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2020-10-06 00:47:51,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:51,858 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2020-10-06 00:47:51,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:47:51,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-06 00:47:51,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:51,859 INFO L225 Difference]: With dead ends: 44 [2020-10-06 00:47:51,859 INFO L226 Difference]: Without dead ends: 25 [2020-10-06 00:47:51,860 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:47:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-06 00:47:51,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-06 00:47:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-06 00:47:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-10-06 00:47:51,863 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2020-10-06 00:47:51,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:51,863 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-06 00:47:51,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:47:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-10-06 00:47:51,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 00:47:51,864 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:51,864 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:51,865 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 00:47:51,865 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:51,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:51,866 INFO L82 PathProgramCache]: Analyzing trace with hash -869615873, now seen corresponding path program 3 times [2020-10-06 00:47:51,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:51,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908337686] [2020-10-06 00:47:51,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:47:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:47:52,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908337686] [2020-10-06 00:47:52,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:47:52,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-06 00:47:52,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [22105710] [2020-10-06 00:47:52,121 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:47:52,123 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:47:52,129 INFO L258 McrAutomatonBuilder]: Finished intersection with 21 states and 24 transitions. [2020-10-06 00:47:52,129 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:47:52,158 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-06 00:47:52,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:52,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:52,166 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:47:52,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:52,170 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-06 00:47:52,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:47:52,171 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-06 00:47:52,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:47:52,198 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:47:52,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-06 00:47:52,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:47:52,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-06 00:47:52,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:47:52,199 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 8 states. [2020-10-06 00:47:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:47:52,313 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-10-06 00:47:52,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:47:52,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-06 00:47:52,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:47:52,315 INFO L225 Difference]: With dead ends: 34 [2020-10-06 00:47:52,315 INFO L226 Difference]: Without dead ends: 21 [2020-10-06 00:47:52,315 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-06 00:47:52,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-10-06 00:47:52,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-06 00:47:52,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-06 00:47:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-10-06 00:47:52,317 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2020-10-06 00:47:52,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:47:52,317 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-10-06 00:47:52,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-06 00:47:52,318 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-10-06 00:47:52,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 00:47:52,318 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:47:52,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:47:52,319 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 00:47:52,319 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:47:52,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:47:52,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1239204549, now seen corresponding path program 4 times [2020-10-06 00:47:52,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:47:52,321 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380257260] [2020-10-06 00:47:52,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:47:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:47:52,359 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:47:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:47:52,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:47:52,419 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 00:47:52,420 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 00:47:52,420 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 00:47:52,436 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,437 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,438 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,438 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,439 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,439 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,440 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,440 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,441 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,441 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,442 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,442 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,442 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,442 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,442 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,443 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,443 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,444 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,444 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,444 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,444 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,444 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,445 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,445 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,445 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,446 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,446 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,446 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,446 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,446 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,447 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,447 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,447 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,447 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,447 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,448 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,448 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,449 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,449 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,449 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,450 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,450 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,450 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,450 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,451 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,451 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,451 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,451 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:47:52,451 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:47:52,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 12:47:52 BasicIcfg [2020-10-06 00:47:52,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 00:47:52,533 INFO L168 Benchmark]: Toolchain (without parser) took 10338.79 ms. Allocated memory was 140.0 MB in the beginning and 323.5 MB in the end (delta: 183.5 MB). Free memory was 102.0 MB in the beginning and 288.1 MB in the end (delta: -186.0 MB). Peak memory consumption was 199.7 MB. Max. memory is 7.1 GB. [2020-10-06 00:47:52,534 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-06 00:47:52,535 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.02 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 101.6 MB in the beginning and 158.5 MB in the end (delta: -56.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2020-10-06 00:47:52,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.40 ms. Allocated memory is still 203.4 MB. Free memory was 158.5 MB in the beginning and 155.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-06 00:47:52,536 INFO L168 Benchmark]: Boogie Preprocessor took 38.01 ms. Allocated memory is still 203.4 MB. Free memory was 155.8 MB in the beginning and 153.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-06 00:47:52,537 INFO L168 Benchmark]: RCFGBuilder took 2107.96 ms. Allocated memory was 203.4 MB in the beginning and 249.6 MB in the end (delta: 46.1 MB). Free memory was 153.8 MB in the beginning and 206.7 MB in the end (delta: -52.9 MB). Peak memory consumption was 106.0 MB. Max. memory is 7.1 GB. [2020-10-06 00:47:52,538 INFO L168 Benchmark]: TraceAbstraction took 7279.79 ms. Allocated memory was 249.6 MB in the beginning and 323.5 MB in the end (delta: 73.9 MB). Free memory was 204.9 MB in the beginning and 288.1 MB in the end (delta: -83.2 MB). Peak memory consumption was 193.0 MB. Max. memory is 7.1 GB. [2020-10-06 00:47:52,542 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 829.02 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 101.6 MB in the beginning and 158.5 MB in the end (delta: -56.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.40 ms. Allocated memory is still 203.4 MB. Free memory was 158.5 MB in the beginning and 155.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.01 ms. Allocated memory is still 203.4 MB. Free memory was 155.8 MB in the beginning and 153.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2107.96 ms. Allocated memory was 203.4 MB in the beginning and 249.6 MB in the end (delta: 46.1 MB). Free memory was 153.8 MB in the beginning and 206.7 MB in the end (delta: -52.9 MB). Peak memory consumption was 106.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7279.79 ms. Allocated memory was 249.6 MB in the beginning and 323.5 MB in the end (delta: 73.9 MB). Free memory was 204.9 MB in the beginning and 288.1 MB in the end (delta: -83.2 MB). Peak memory consumption was 193.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 80 ProgramPointsBefore, 28 ProgramPointsAfterwards, 75 TransitionsBefore, 22 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 424 VarBasedMoverChecksPositive, 19 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2408 CheckedPairsTotal, 64 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L700] 0 _Bool main$tmp_guard0; [L701] 0 _Bool main$tmp_guard1; [L703] 0 int x = 0; [L704] 0 _Bool x$flush_delayed; [L705] 0 int x$mem_tmp; [L706] 0 _Bool x$r_buff0_thd0; [L707] 0 _Bool x$r_buff0_thd1; [L708] 0 _Bool x$r_buff0_thd2; [L709] 0 _Bool x$r_buff1_thd0; [L710] 0 _Bool x$r_buff1_thd1; [L711] 0 _Bool x$r_buff1_thd2; [L712] 0 _Bool x$read_delayed; [L713] 0 int *x$read_delayed_var; [L714] 0 int x$w_buff0; [L715] 0 _Bool x$w_buff0_used; [L716] 0 int x$w_buff1; [L717] 0 _Bool x$w_buff1_used; [L719] 0 int y = 0; [L720] 0 _Bool weak$$choice0; [L721] 0 _Bool weak$$choice2; [L781] 0 pthread_t t1455; [L782] FCALL, FORK 0 pthread_create(&t1455, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 0 pthread_t t1456; [L784] FCALL, FORK 0 pthread_create(&t1456, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$w_buff1 = x$w_buff0 [L746] 2 x$w_buff0 = 2 [L747] 2 x$w_buff1_used = x$w_buff0_used [L748] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L750] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L751] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L752] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L753] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L759] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L760] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L761] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L763] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L763] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L731] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L731] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L732] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L734] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L735] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L740] 1 return 0; [L786] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L3] COND FALSE 0 !(!cond) [L790] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L790] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L791] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L791] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L792] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L793] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L794] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L797] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 0 x$flush_delayed = weak$$choice2 [L800] 0 x$mem_tmp = x [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L801] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L802] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L802] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L803] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L803] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L803] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L803] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L804] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L804] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L805] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L806] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L806] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L807] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L807] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L807] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L807] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L807] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L808] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L809] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L809] 0 x = x$flush_delayed ? x$mem_tmp : x [L810] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 74 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.0s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 123 SDtfs, 146 SDslu, 258 SDs, 0 SdLazy, 202 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred 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.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 8052 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...