/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/mix045_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 00:41:18,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 00:41:18,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 00:41:18,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 00:41:18,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 00:41:19,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 00:41:19,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 00:41:19,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 00:41:19,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 00:41:19,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 00:41:19,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 00:41:19,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 00:41:19,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 00:41:19,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 00:41:19,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 00:41:19,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 00:41:19,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 00:41:19,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 00:41:19,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 00:41:19,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 00:41:19,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 00:41:19,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 00:41:19,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 00:41:19,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 00:41:19,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 00:41:19,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 00:41:19,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 00:41:19,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 00:41:19,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 00:41:19,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 00:41:19,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 00:41:19,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 00:41:19,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 00:41:19,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 00:41:19,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 00:41:19,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 00:41:19,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 00:41:19,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 00:41:19,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 00:41:19,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 00:41:19,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 00:41:19,036 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:41:19,057 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 00:41:19,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 00:41:19,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 00:41:19,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 00:41:19,059 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 00:41:19,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 00:41:19,060 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 00:41:19,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 00:41:19,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 00:41:19,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 00:41:19,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 00:41:19,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 00:41:19,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 00:41:19,061 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 00:41:19,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 00:41:19,062 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 00:41:19,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 00:41:19,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 00:41:19,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 00:41:19,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 00:41:19,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 00:41:19,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:41:19,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 00:41:19,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 00:41:19,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 00:41:19,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 00:41:19,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 00:41:19,064 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 00:41:19,064 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 00:41:19,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 00:41:19,065 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 00:41:19,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 00:41:19,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 00:41:19,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 00:41:19,367 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 00:41:19,368 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 00:41:19,368 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2020-10-06 00:41:19,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa900ec2/6aa69cf286634013a65fe73c0fb9d5a3/FLAG6abcabadc [2020-10-06 00:41:19,951 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 00:41:19,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2020-10-06 00:41:19,968 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa900ec2/6aa69cf286634013a65fe73c0fb9d5a3/FLAG6abcabadc [2020-10-06 00:41:20,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa900ec2/6aa69cf286634013a65fe73c0fb9d5a3 [2020-10-06 00:41:20,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 00:41:20,238 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 00:41:20,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 00:41:20,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 00:41:20,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 00:41:20,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:41:20" (1/1) ... [2020-10-06 00:41:20,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b68cce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:20, skipping insertion in model container [2020-10-06 00:41:20,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:41:20" (1/1) ... [2020-10-06 00:41:20,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 00:41:20,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 00:41:20,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:41:20,915 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 00:41:21,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:41:21,111 INFO L208 MainTranslator]: Completed translation [2020-10-06 00:41:21,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:21 WrapperNode [2020-10-06 00:41:21,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 00:41:21,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 00:41:21,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 00:41:21,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 00:41:21,124 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:41:21" (1/1) ... [2020-10-06 00:41:21,153 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:41:21" (1/1) ... [2020-10-06 00:41:21,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 00:41:21,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 00:41:21,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 00:41:21,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 00:41:21,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:21" (1/1) ... [2020-10-06 00:41:21,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:21" (1/1) ... [2020-10-06 00:41:21,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:21" (1/1) ... [2020-10-06 00:41:21,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:21" (1/1) ... [2020-10-06 00:41:21,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:21" (1/1) ... [2020-10-06 00:41:21,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:21" (1/1) ... [2020-10-06 00:41:21,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:21" (1/1) ... [2020-10-06 00:41:21,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 00:41:21,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 00:41:21,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 00:41:21,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 00:41:21,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:21" (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:41:21,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 00:41:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 00:41:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 00:41:21,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 00:41:21,305 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 00:41:21,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 00:41:21,305 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 00:41:21,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 00:41:21,305 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-06 00:41:21,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-06 00:41:21,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 00:41:21,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 00:41:21,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 00:41:21,308 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:41:23,132 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 00:41:23,132 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 00:41:23,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:41:23 BoogieIcfgContainer [2020-10-06 00:41:23,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 00:41:23,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 00:41:23,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 00:41:23,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 00:41:23,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 12:41:20" (1/3) ... [2020-10-06 00:41:23,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc8ee2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:41:23, skipping insertion in model container [2020-10-06 00:41:23,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:41:21" (2/3) ... [2020-10-06 00:41:23,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bc8ee2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:41:23, skipping insertion in model container [2020-10-06 00:41:23,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:41:23" (3/3) ... [2020-10-06 00:41:23,149 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_tso.oepc.i [2020-10-06 00:41:23,160 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 00:41:23,160 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 00:41:23,168 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 00:41:23,169 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 00:41:23,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,214 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,214 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,215 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,215 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,217 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,218 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,218 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,219 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,219 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,234 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,235 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,235 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,238 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,238 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,243 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,243 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,244 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:41:23,259 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-06 00:41:23,288 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 00:41:23,288 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 00:41:23,288 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 00:41:23,289 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 00:41:23,289 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 00:41:23,289 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 00:41:23,289 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 00:41:23,290 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 00:41:23,312 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 205 flow [2020-10-06 00:41:23,314 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-10-06 00:41:23,383 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-06 00:41:23,384 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:41:23,391 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-06 00:41:23,397 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-10-06 00:41:23,425 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-06 00:41:23,426 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:41:23,427 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-06 00:41:23,429 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1692 [2020-10-06 00:41:23,430 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 00:41:24,894 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-06 00:41:24,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-06 00:41:24,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:41:24,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-06 00:41:24,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:41:25,769 WARN L193 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2020-10-06 00:41:26,940 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-06 00:41:27,050 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-06 00:41:27,919 WARN L193 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-06 00:41:28,268 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-06 00:41:29,132 WARN L193 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 126 [2020-10-06 00:41:29,499 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-06 00:41:30,106 WARN L193 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-06 00:41:30,435 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-06 00:41:30,560 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-06 00:41:30,676 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-06 00:41:30,919 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-10-06 00:41:31,026 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-10-06 00:41:31,034 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4375 [2020-10-06 00:41:31,034 INFO L214 etLargeBlockEncoding]: Total number of compositions: 80 [2020-10-06 00:41:31,037 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-06 00:41:31,089 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 750 states. [2020-10-06 00:41:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2020-10-06 00:41:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-06 00:41:31,098 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:31,099 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:31,100 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:31,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:31,109 INFO L82 PathProgramCache]: Analyzing trace with hash -139107104, now seen corresponding path program 1 times [2020-10-06 00:41:31,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:31,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245699386] [2020-10-06 00:41:31,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:31,349 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:41:31,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245699386] [2020-10-06 00:41:31,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:31,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:41:31,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1430425442] [2020-10-06 00:41:31,352 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:31,355 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:31,370 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-06 00:41:31,370 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:31,375 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:41:31,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:41:31,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:31,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:41:31,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:41:31,389 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 3 states. [2020-10-06 00:41:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:31,482 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-10-06 00:41:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:41:31,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-06 00:41:31,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:31,506 INFO L225 Difference]: With dead ends: 650 [2020-10-06 00:41:31,506 INFO L226 Difference]: Without dead ends: 530 [2020-10-06 00:41:31,507 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:41:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-10-06 00:41:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-06 00:41:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-06 00:41:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2020-10-06 00:41:31,603 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2020-10-06 00:41:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:31,604 INFO L479 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2020-10-06 00:41:31,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:41:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2020-10-06 00:41:31,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 00:41:31,606 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:31,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:31,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 00:41:31,607 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:31,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:31,608 INFO L82 PathProgramCache]: Analyzing trace with hash -537885840, now seen corresponding path program 1 times [2020-10-06 00:41:31,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:31,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341835418] [2020-10-06 00:41:31,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:31,773 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:41:31,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341835418] [2020-10-06 00:41:31,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:31,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:41:31,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [799688078] [2020-10-06 00:41:31,774 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:31,776 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:31,778 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 00:41:31,778 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:31,778 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:41:31,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:41:31,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:31,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:41:31,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:41:31,781 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand 3 states. [2020-10-06 00:41:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:31,794 INFO L93 Difference]: Finished difference Result 490 states and 1480 transitions. [2020-10-06 00:41:31,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:41:31,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-06 00:41:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:31,800 INFO L225 Difference]: With dead ends: 490 [2020-10-06 00:41:31,800 INFO L226 Difference]: Without dead ends: 490 [2020-10-06 00:41:31,801 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:41:31,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-10-06 00:41:31,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2020-10-06 00:41:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2020-10-06 00:41:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1480 transitions. [2020-10-06 00:41:31,833 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1480 transitions. Word has length 9 [2020-10-06 00:41:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:31,833 INFO L479 AbstractCegarLoop]: Abstraction has 490 states and 1480 transitions. [2020-10-06 00:41:31,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:41:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1480 transitions. [2020-10-06 00:41:31,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 00:41:31,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:31,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:31,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 00:41:31,836 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:31,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:31,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1512222087, now seen corresponding path program 1 times [2020-10-06 00:41:31,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:31,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275765162] [2020-10-06 00:41:31,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:41:31,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275765162] [2020-10-06 00:41:31,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:31,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:41:31,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1032678770] [2020-10-06 00:41:31,930 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:31,932 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:31,934 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-06 00:41:31,934 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:31,934 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:41:31,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:41:31,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:31,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:41:31,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:41:31,936 INFO L87 Difference]: Start difference. First operand 490 states and 1480 transitions. Second operand 3 states. [2020-10-06 00:41:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:31,950 INFO L93 Difference]: Finished difference Result 482 states and 1450 transitions. [2020-10-06 00:41:31,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:41:31,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-06 00:41:31,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:31,955 INFO L225 Difference]: With dead ends: 482 [2020-10-06 00:41:31,956 INFO L226 Difference]: Without dead ends: 482 [2020-10-06 00:41:31,956 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:41:31,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-06 00:41:31,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-10-06 00:41:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-06 00:41:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1450 transitions. [2020-10-06 00:41:31,977 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1450 transitions. Word has length 11 [2020-10-06 00:41:31,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:31,977 INFO L479 AbstractCegarLoop]: Abstraction has 482 states and 1450 transitions. [2020-10-06 00:41:31,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:41:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1450 transitions. [2020-10-06 00:41:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 00:41:31,980 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:31,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:31,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 00:41:31,980 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:31,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:31,981 INFO L82 PathProgramCache]: Analyzing trace with hash 365755524, now seen corresponding path program 1 times [2020-10-06 00:41:31,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:31,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675926496] [2020-10-06 00:41:31,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:32,098 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:41:32,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675926496] [2020-10-06 00:41:32,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:32,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:41:32,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369236269] [2020-10-06 00:41:32,099 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:32,101 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:32,104 INFO L258 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-10-06 00:41:32,105 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:32,142 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 00:41:32,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:32,143 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:32,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:32,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:32,147 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:32,160 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:32,173 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:32,183 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:32,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:32,284 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6246#(and (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0) (or (= (mod ~y$w_buff1_used~0 256) 0) (= ~y$w_buff1~0 ~y$w_buff0~0)) (= ~y$r_buff0_thd0~0 0))] [2020-10-06 00:41:32,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:41:32,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:32,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:41:32,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:41:32,285 INFO L87 Difference]: Start difference. First operand 482 states and 1450 transitions. Second operand 6 states. [2020-10-06 00:41:32,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:32,381 INFO L93 Difference]: Finished difference Result 470 states and 1406 transitions. [2020-10-06 00:41:32,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:41:32,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-06 00:41:32,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:32,386 INFO L225 Difference]: With dead ends: 470 [2020-10-06 00:41:32,386 INFO L226 Difference]: Without dead ends: 470 [2020-10-06 00:41:32,387 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:41:32,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-10-06 00:41:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2020-10-06 00:41:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2020-10-06 00:41:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1406 transitions. [2020-10-06 00:41:32,435 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1406 transitions. Word has length 12 [2020-10-06 00:41:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:32,435 INFO L479 AbstractCegarLoop]: Abstraction has 470 states and 1406 transitions. [2020-10-06 00:41:32,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:41:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1406 transitions. [2020-10-06 00:41:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 00:41:32,443 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:32,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:32,443 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 00:41:32,444 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:32,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:32,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1546482384, now seen corresponding path program 1 times [2020-10-06 00:41:32,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:32,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105182203] [2020-10-06 00:41:32,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:32,562 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:41:32,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105182203] [2020-10-06 00:41:32,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:32,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:41:32,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [719496032] [2020-10-06 00:41:32,563 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:32,565 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:32,569 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 29 transitions. [2020-10-06 00:41:32,569 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:32,611 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:32,615 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:32,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:32,628 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:32,636 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:41:32,652 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7664#(and (= ~y~0 1) (= ~y$r_buff0_thd0~0 0))] [2020-10-06 00:41:32,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:41:32,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:32,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:41:32,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:41:32,654 INFO L87 Difference]: Start difference. First operand 470 states and 1406 transitions. Second operand 6 states. [2020-10-06 00:41:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:32,714 INFO L93 Difference]: Finished difference Result 494 states and 1464 transitions. [2020-10-06 00:41:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:41:32,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-06 00:41:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:32,721 INFO L225 Difference]: With dead ends: 494 [2020-10-06 00:41:32,721 INFO L226 Difference]: Without dead ends: 494 [2020-10-06 00:41:32,721 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:41:32,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2020-10-06 00:41:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 486. [2020-10-06 00:41:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2020-10-06 00:41:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1446 transitions. [2020-10-06 00:41:32,741 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1446 transitions. Word has length 13 [2020-10-06 00:41:32,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:32,741 INFO L479 AbstractCegarLoop]: Abstraction has 486 states and 1446 transitions. [2020-10-06 00:41:32,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:41:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1446 transitions. [2020-10-06 00:41:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 00:41:32,743 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:32,743 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:32,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 00:41:32,743 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:32,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:32,744 INFO L82 PathProgramCache]: Analyzing trace with hash -697643707, now seen corresponding path program 1 times [2020-10-06 00:41:32,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:32,745 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057677067] [2020-10-06 00:41:32,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:32,817 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:41:32,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057677067] [2020-10-06 00:41:32,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:32,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:41:32,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [340362642] [2020-10-06 00:41:32,818 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:32,821 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:32,827 INFO L258 McrAutomatonBuilder]: Finished intersection with 23 states and 30 transitions. [2020-10-06 00:41:32,827 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:32,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:32,876 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9135#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-06 00:41:32,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:41:32,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:32,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:41:32,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:41:32,877 INFO L87 Difference]: Start difference. First operand 486 states and 1446 transitions. Second operand 5 states. [2020-10-06 00:41:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:32,947 INFO L93 Difference]: Finished difference Result 345 states and 915 transitions. [2020-10-06 00:41:32,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:41:32,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-06 00:41:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:32,950 INFO L225 Difference]: With dead ends: 345 [2020-10-06 00:41:32,950 INFO L226 Difference]: Without dead ends: 217 [2020-10-06 00:41:32,950 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:41:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-10-06 00:41:32,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2020-10-06 00:41:32,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2020-10-06 00:41:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 497 transitions. [2020-10-06 00:41:32,958 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 497 transitions. Word has length 14 [2020-10-06 00:41:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:32,958 INFO L479 AbstractCegarLoop]: Abstraction has 217 states and 497 transitions. [2020-10-06 00:41:32,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:41:32,958 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 497 transitions. [2020-10-06 00:41:32,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 00:41:32,959 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:32,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:32,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 00:41:32,960 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:32,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:32,960 INFO L82 PathProgramCache]: Analyzing trace with hash -726028274, now seen corresponding path program 1 times [2020-10-06 00:41:32,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:32,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437647005] [2020-10-06 00:41:32,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:33,097 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:41:33,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437647005] [2020-10-06 00:41:33,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:33,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:41:33,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1426118294] [2020-10-06 00:41:33,098 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:33,102 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:33,107 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 25 transitions. [2020-10-06 00:41:33,107 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:33,120 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:33,121 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:33,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:33,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:33,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:33,127 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:33,138 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:33,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:33,144 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-06 00:41:33,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:33,226 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:33,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:33,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:33,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:33,229 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:33,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:33,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:33,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:33,247 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:33,252 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:41:33,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:33,315 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [9925#(and (= ~x~0 1) (or (and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0))) (and (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0)))), 9926#(or (and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0))) (and (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0)))] [2020-10-06 00:41:33,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-06 00:41:33,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:33,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-06 00:41:33,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:41:33,316 INFO L87 Difference]: Start difference. First operand 217 states and 497 transitions. Second operand 8 states. [2020-10-06 00:41:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:33,497 INFO L93 Difference]: Finished difference Result 356 states and 786 transitions. [2020-10-06 00:41:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-06 00:41:33,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-10-06 00:41:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:33,500 INFO L225 Difference]: With dead ends: 356 [2020-10-06 00:41:33,500 INFO L226 Difference]: Without dead ends: 248 [2020-10-06 00:41:33,501 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:41:33,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-10-06 00:41:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 212. [2020-10-06 00:41:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-10-06 00:41:33,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 451 transitions. [2020-10-06 00:41:33,508 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 451 transitions. Word has length 17 [2020-10-06 00:41:33,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:33,509 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 451 transitions. [2020-10-06 00:41:33,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-06 00:41:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 451 transitions. [2020-10-06 00:41:33,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-06 00:41:33,510 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:33,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:33,510 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 00:41:33,510 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:33,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:33,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1032040049, now seen corresponding path program 1 times [2020-10-06 00:41:33,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:33,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004390258] [2020-10-06 00:41:33,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:33,655 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:41:33,656 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004390258] [2020-10-06 00:41:33,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:33,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:41:33,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [747039588] [2020-10-06 00:41:33,656 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:33,661 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:33,675 INFO L258 McrAutomatonBuilder]: Finished intersection with 39 states and 59 transitions. [2020-10-06 00:41:33,675 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:33,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:33,757 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [10715#(not (= 3 ~__unbuffered_cnt~0)), 10716#(not (= ~__unbuffered_cnt~0 2)), 10717#(not (= ~__unbuffered_cnt~0 1)), 10718#(<= ~__unbuffered_cnt~0 0)] [2020-10-06 00:41:33,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-06 00:41:33,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:33,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-06 00:41:33,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-10-06 00:41:33,759 INFO L87 Difference]: Start difference. First operand 212 states and 451 transitions. Second operand 10 states. [2020-10-06 00:41:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:33,838 INFO L93 Difference]: Finished difference Result 191 states and 408 transitions. [2020-10-06 00:41:33,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:41:33,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-10-06 00:41:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:33,840 INFO L225 Difference]: With dead ends: 191 [2020-10-06 00:41:33,840 INFO L226 Difference]: Without dead ends: 113 [2020-10-06 00:41:33,841 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-06 00:41:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-06 00:41:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2020-10-06 00:41:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-06 00:41:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 223 transitions. [2020-10-06 00:41:33,846 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 223 transitions. Word has length 18 [2020-10-06 00:41:33,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:33,847 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 223 transitions. [2020-10-06 00:41:33,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-06 00:41:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 223 transitions. [2020-10-06 00:41:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 00:41:33,847 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:33,848 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:33,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 00:41:33,850 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:33,850 INFO L82 PathProgramCache]: Analyzing trace with hash 430399513, now seen corresponding path program 1 times [2020-10-06 00:41:33,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:33,853 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983723252] [2020-10-06 00:41:33,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:41:34,163 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:41:34,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983723252] [2020-10-06 00:41:34,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:41:34,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-06 00:41:34,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1054107806] [2020-10-06 00:41:34,164 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:41:34,169 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:41:34,181 INFO L258 McrAutomatonBuilder]: Finished intersection with 52 states and 82 transitions. [2020-10-06 00:41:34,182 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:41:34,199 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 2, 2, 1] term [2020-10-06 00:41:34,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,200 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 2, 2, 1] term [2020-10-06 00:41:34,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,207 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:34,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,209 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:34,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:34,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,230 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:34,236 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:34,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,247 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-10-06 00:41:34,247 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,281 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 2, 2, 1] term [2020-10-06 00:41:34,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,282 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 2, 2, 1] term [2020-10-06 00:41:34,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,286 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:34,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,287 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:34,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,293 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:34,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,309 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:34,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,317 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:34,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,333 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-10-06 00:41:34,334 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,369 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:34,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,375 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:41:34,375 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,381 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:34,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:34,398 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 00:41:34,403 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:41:34,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:34,418 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,432 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:34,436 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:34,440 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:41:34,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:34,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,456 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:34,462 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-06 00:41:34,462 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:34,585 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:34,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,593 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:34,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,600 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:34,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:41:34,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,621 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:41:34,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:34,648 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-06 00:41:34,648 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:34,677 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:41:34,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,680 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:41:34,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:41:34,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:34,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:41:34,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:34,700 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-06 00:41:34,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:41:34,720 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11138#(and (= ~y$r_buff1_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (or (and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0))) (and (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 0))) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))] [2020-10-06 00:41:34,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 00:41:34,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:41:34,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 00:41:34,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:41:34,721 INFO L87 Difference]: Start difference. First operand 109 states and 223 transitions. Second operand 9 states. [2020-10-06 00:41:34,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:41:34,804 INFO L93 Difference]: Finished difference Result 123 states and 245 transitions. [2020-10-06 00:41:34,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:41:34,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-06 00:41:34,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:41:34,806 INFO L225 Difference]: With dead ends: 123 [2020-10-06 00:41:34,806 INFO L226 Difference]: Without dead ends: 97 [2020-10-06 00:41:34,806 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:41:34,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-06 00:41:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-06 00:41:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-06 00:41:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 195 transitions. [2020-10-06 00:41:34,810 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 195 transitions. Word has length 21 [2020-10-06 00:41:34,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:41:34,810 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 195 transitions. [2020-10-06 00:41:34,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 00:41:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 195 transitions. [2020-10-06 00:41:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-06 00:41:34,811 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:41:34,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:41:34,811 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 00:41:34,812 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:41:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:41:34,812 INFO L82 PathProgramCache]: Analyzing trace with hash 288272655, now seen corresponding path program 2 times [2020-10-06 00:41:34,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:41:34,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059936802] [2020-10-06 00:41:34,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:41:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:41:34,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:41:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:41:34,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:41:34,925 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 00:41:34,925 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 00:41:34,926 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 00:41:34,927 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 00:41:34,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L821-->L828: Formula: (let ((.cse6 (= (mod ~y$w_buff1_used~0_In-1737262380 256) 0)) (.cse7 (= (mod ~y$r_buff1_thd0~0_In-1737262380 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In-1737262380 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In-1737262380 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~y$r_buff0_thd0~0_In-1737262380 ~y$r_buff0_thd0~0_Out-1737262380) (or (and .cse0 .cse1 (= ~y$w_buff0_used~0_Out-1737262380 0)) (and .cse2 (= ~y$w_buff0_used~0_Out-1737262380 ~y$w_buff0_used~0_In-1737262380))) (or (and (= ~y$w_buff1_used~0_In-1737262380 ~y$w_buff1_used~0_Out-1737262380) .cse3) (and .cse4 (= ~y$w_buff1_used~0_Out-1737262380 0) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1737262380 0)) (= ~y$r_buff1_thd0~0_In-1737262380 ~y$r_buff1_thd0~0_Out-1737262380) (or (and .cse0 (= ~y$w_buff0~0_In-1737262380 ~y~0_Out-1737262380) .cse1) (and .cse2 (or (and (= ~y~0_Out-1737262380 ~y~0_In-1737262380) .cse3) (and .cse4 (= ~y$w_buff1~0_In-1737262380 ~y~0_Out-1737262380) .cse5)))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1737262380 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1737262380|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1737262380|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1737262380, ~y$w_buff1~0=~y$w_buff1~0_In-1737262380, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1737262380, ~y$w_buff0~0=~y$w_buff0~0_In-1737262380, ~y~0=~y~0_In-1737262380, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1737262380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1737262380} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1737262380, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1737262380|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1737262380|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1737262380|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1737262380|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1737262380|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1737262380|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1737262380|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1737262380, ~y$w_buff1~0=~y$w_buff1~0_In-1737262380, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1737262380, ~y$w_buff0~0=~y$w_buff0~0_In-1737262380, ~y~0=~y~0_Out-1737262380, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1737262380, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1737262380} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-06 00:41:34,942 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:41:34,943 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,944 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:41:34,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,945 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:41:34,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,945 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:41:34,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,945 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:41:34,946 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,946 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:41:34,946 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,946 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:41:34,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,947 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:41:34,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,947 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:41:34,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,947 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:41:34,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,948 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:41:34,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,948 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:41:34,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,949 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:41:34,949 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,949 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:41:34,949 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,950 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:41:34,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,950 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:41:34,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,950 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:41:34,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,951 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:41:34,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,951 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:41:34,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,951 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:41:34,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,952 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:41:34,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,952 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:41:34,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:34,952 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:41:34,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:41:35,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 12:41:35 BasicIcfg [2020-10-06 00:41:35,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 00:41:35,034 INFO L168 Benchmark]: Toolchain (without parser) took 14794.25 ms. Allocated memory was 145.8 MB in the beginning and 354.9 MB in the end (delta: 209.2 MB). Free memory was 100.6 MB in the beginning and 150.6 MB in the end (delta: -50.0 MB). Peak memory consumption was 159.2 MB. Max. memory is 7.1 GB. [2020-10-06 00:41:35,035 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 120.5 MB in the beginning and 120.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:41:35,035 INFO L168 Benchmark]: CACSL2BoogieTranslator took 873.75 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 100.2 MB in the beginning and 155.0 MB in the end (delta: -54.8 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2020-10-06 00:41:35,037 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.41 ms. Allocated memory is still 202.4 MB. Free memory was 155.0 MB in the beginning and 151.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-10-06 00:41:35,038 INFO L168 Benchmark]: Boogie Preprocessor took 36.52 ms. Allocated memory is still 202.4 MB. Free memory was 151.5 MB in the beginning and 149.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-06 00:41:35,039 INFO L168 Benchmark]: RCFGBuilder took 1911.74 ms. Allocated memory was 202.4 MB in the beginning and 249.6 MB in the end (delta: 47.2 MB). Free memory was 149.4 MB in the beginning and 200.5 MB in the end (delta: -51.1 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. [2020-10-06 00:41:35,041 INFO L168 Benchmark]: TraceAbstraction took 11891.27 ms. Allocated memory was 249.6 MB in the beginning and 354.9 MB in the end (delta: 105.4 MB). Free memory was 198.6 MB in the beginning and 150.6 MB in the end (delta: 48.0 MB). Peak memory consumption was 153.4 MB. Max. memory is 7.1 GB. [2020-10-06 00:41:35,050 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.20 ms. Allocated memory is still 145.8 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 873.75 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 100.2 MB in the beginning and 155.0 MB in the end (delta: -54.8 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.41 ms. Allocated memory is still 202.4 MB. Free memory was 155.0 MB in the beginning and 151.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.52 ms. Allocated memory is still 202.4 MB. Free memory was 151.5 MB in the beginning and 149.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1911.74 ms. Allocated memory was 202.4 MB in the beginning and 249.6 MB in the end (delta: 47.2 MB). Free memory was 149.4 MB in the beginning and 200.5 MB in the end (delta: -51.1 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11891.27 ms. Allocated memory was 249.6 MB in the beginning and 354.9 MB in the end (delta: 105.4 MB). Free memory was 198.6 MB in the beginning and 150.6 MB in the end (delta: 48.0 MB). Peak memory consumption was 153.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.7s, 103 ProgramPointsBefore, 36 ProgramPointsAfterwards, 95 TransitionsBefore, 26 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 889 VarBasedMoverChecksPositive, 39 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4375 CheckedPairsTotal, 80 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L702] 0 int __unbuffered_p2_EBX = 0; [L704] 0 int a = 0; [L705] 0 _Bool main$tmp_guard0; [L706] 0 _Bool main$tmp_guard1; [L708] 0 int x = 0; [L710] 0 int y = 0; [L711] 0 _Bool y$flush_delayed; [L712] 0 int y$mem_tmp; [L713] 0 _Bool y$r_buff0_thd0; [L714] 0 _Bool y$r_buff0_thd1; [L715] 0 _Bool y$r_buff0_thd2; [L716] 0 _Bool y$r_buff0_thd3; [L717] 0 _Bool y$r_buff1_thd0; [L718] 0 _Bool y$r_buff1_thd1; [L719] 0 _Bool y$r_buff1_thd2; [L720] 0 _Bool y$r_buff1_thd3; [L721] 0 _Bool y$read_delayed; [L722] 0 int *y$read_delayed_var; [L723] 0 int y$w_buff0; [L724] 0 _Bool y$w_buff0_used; [L725] 0 int y$w_buff1; [L726] 0 _Bool y$w_buff1_used; [L728] 0 int z = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1211; [L813] FCALL, FORK 0 pthread_create(&t1211, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] 0 pthread_t t1212; [L815] FCALL, FORK 0 pthread_create(&t1212, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] 0 pthread_t t1213; [L817] FCALL, FORK 0 pthread_create(&t1213, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L769] 3 y$w_buff1 = y$w_buff0 [L770] 3 y$w_buff0 = 2 [L771] 3 y$w_buff1_used = y$w_buff0_used [L772] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L774] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L775] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L776] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L777] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L778] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 z = 1 [L784] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L744] 1 return 0; [L749] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L794] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L758] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L759] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 2 return 0; [L819] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L830] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 0 y$flush_delayed = weak$$choice2 [L833] 0 y$mem_tmp = y [L834] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L835] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L842] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L842] 0 y = y$flush_delayed ? y$mem_tmp : y [L843] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.6s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 221 SDtfs, 287 SDslu, 435 SDs, 0 SdLazy, 242 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 48 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 12914 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...