/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:12:11,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:12:11,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:12:11,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:12:11,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:12:11,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:12:11,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:12:11,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:12:11,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:12:11,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:12:11,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:12:11,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:12:11,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:12:11,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:12:11,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:12:11,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:12:11,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:12:11,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:12:11,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:12:11,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:12:11,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:12:11,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:12:11,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:12:11,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:12:11,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:12:11,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:12:11,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:12:11,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:12:11,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:12:11,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:12:11,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:12:11,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:12:11,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:12:11,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:12:11,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:12:11,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:12:11,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:12:11,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:12:11,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:12:11,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:12:11,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:12:11,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:12:11,279 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:12:11,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:12:11,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:12:11,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:12:11,281 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:12:11,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:12:11,282 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:12:11,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:12:11,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:12:11,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:12:11,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:12:11,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:12:11,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:12:11,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:12:11,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:12:11,284 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:12:11,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:12:11,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:12:11,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:12:11,285 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:12:11,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:12:11,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:12:11,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:12:11,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:12:11,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:12:11,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:12:11,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:12:11,287 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:12:11,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:12:11,287 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:12:11,287 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:12:11,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:12:11,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:12:11,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:12:11,555 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:12:11,555 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:12:11,556 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2019-12-27 18:12:11,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1bc22dd/04ff0e1bfe5c48919a9dab8bbc387523/FLAGae64bca98 [2019-12-27 18:12:12,149 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:12:12,150 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2019-12-27 18:12:12,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1bc22dd/04ff0e1bfe5c48919a9dab8bbc387523/FLAGae64bca98 [2019-12-27 18:12:12,442 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd1bc22dd/04ff0e1bfe5c48919a9dab8bbc387523 [2019-12-27 18:12:12,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:12:12,453 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:12:12,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:12:12,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:12:12,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:12:12,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:12:12" (1/1) ... [2019-12-27 18:12:12,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c507e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:12, skipping insertion in model container [2019-12-27 18:12:12,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:12:12" (1/1) ... [2019-12-27 18:12:12,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:12:12,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:12:13,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:12:13,074 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:12:13,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:12:13,212 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:12:13,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:13 WrapperNode [2019-12-27 18:12:13,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:12:13,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:12:13,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:12:13,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:12:13,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:13" (1/1) ... [2019-12-27 18:12:13,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:13" (1/1) ... [2019-12-27 18:12:13,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:12:13,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:12:13,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:12:13,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:12:13,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:13" (1/1) ... [2019-12-27 18:12:13,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:13" (1/1) ... [2019-12-27 18:12:13,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:13" (1/1) ... [2019-12-27 18:12:13,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:13" (1/1) ... [2019-12-27 18:12:13,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:13" (1/1) ... [2019-12-27 18:12:13,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:13" (1/1) ... [2019-12-27 18:12:13,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:13" (1/1) ... [2019-12-27 18:12:13,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:12:13,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:12:13,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:12:13,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:12:13,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:13" (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 [2019-12-27 18:12:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:12:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:12:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:12:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:12:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:12:13,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:12:13,402 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:12:13,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:12:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:12:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:12:13,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:12:13,408 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:12:14,150 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:12:14,150 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:12:14,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:12:14 BoogieIcfgContainer [2019-12-27 18:12:14,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:12:14,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:12:14,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:12:14,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:12:14,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:12:12" (1/3) ... [2019-12-27 18:12:14,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301e4de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:12:14, skipping insertion in model container [2019-12-27 18:12:14,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:13" (2/3) ... [2019-12-27 18:12:14,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301e4de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:12:14, skipping insertion in model container [2019-12-27 18:12:14,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:12:14" (3/3) ... [2019-12-27 18:12:14,163 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_pso.oepc.i [2019-12-27 18:12:14,171 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:12:14,172 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:12:14,179 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:12:14,181 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:12:14,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,215 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,215 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,215 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,216 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,216 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,226 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,227 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,247 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,247 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,247 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,250 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,251 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:14,268 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 18:12:14,288 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:12:14,288 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:12:14,288 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:12:14,289 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:12:14,289 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:12:14,289 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:12:14,289 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:12:14,289 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:12:14,314 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 18:12:14,316 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 18:12:14,434 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 18:12:14,434 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:12:14,453 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:12:14,468 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 18:12:14,539 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 18:12:14,540 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:12:14,549 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:12:14,561 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 18:12:14,562 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:12:19,399 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 18:12:19,504 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 18:12:19,535 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46090 [2019-12-27 18:12:19,536 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 18:12:19,539 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 91 transitions [2019-12-27 18:12:19,984 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8654 states. [2019-12-27 18:12:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states. [2019-12-27 18:12:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:12:19,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:19,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:12:19,994 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:20,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:20,001 INFO L82 PathProgramCache]: Analyzing trace with hash 722891, now seen corresponding path program 1 times [2019-12-27 18:12:20,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:20,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047954965] [2019-12-27 18:12:20,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:20,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047954965] [2019-12-27 18:12:20,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:20,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:12:20,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1877043015] [2019-12-27 18:12:20,206 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:20,211 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:20,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:12:20,224 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:20,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:20,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:12:20,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:20,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:12:20,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:12:20,242 INFO L87 Difference]: Start difference. First operand 8654 states. Second operand 3 states. [2019-12-27 18:12:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:20,620 INFO L93 Difference]: Finished difference Result 8604 states and 28108 transitions. [2019-12-27 18:12:20,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:12:20,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:12:20,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:20,746 INFO L225 Difference]: With dead ends: 8604 [2019-12-27 18:12:20,747 INFO L226 Difference]: Without dead ends: 8436 [2019-12-27 18:12:20,748 INFO L631 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 [2019-12-27 18:12:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8436 states. [2019-12-27 18:12:21,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8436 to 8436. [2019-12-27 18:12:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8436 states. [2019-12-27 18:12:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 27590 transitions. [2019-12-27 18:12:21,162 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 27590 transitions. Word has length 3 [2019-12-27 18:12:21,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:21,163 INFO L462 AbstractCegarLoop]: Abstraction has 8436 states and 27590 transitions. [2019-12-27 18:12:21,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:12:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 27590 transitions. [2019-12-27 18:12:21,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:12:21,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:21,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:21,169 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:21,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:21,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1596153002, now seen corresponding path program 1 times [2019-12-27 18:12:21,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:21,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017624497] [2019-12-27 18:12:21,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:21,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017624497] [2019-12-27 18:12:21,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:21,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:12:21,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1225512330] [2019-12-27 18:12:21,360 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:21,361 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:21,364 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:12:21,364 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:21,365 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:21,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:12:21,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:21,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:12:21,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:12:21,368 INFO L87 Difference]: Start difference. First operand 8436 states and 27590 transitions. Second operand 4 states. [2019-12-27 18:12:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:21,874 INFO L93 Difference]: Finished difference Result 13130 states and 41153 transitions. [2019-12-27 18:12:21,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:12:21,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:12:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:21,954 INFO L225 Difference]: With dead ends: 13130 [2019-12-27 18:12:21,954 INFO L226 Difference]: Without dead ends: 13123 [2019-12-27 18:12:21,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2019-12-27 18:12:22,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 11988. [2019-12-27 18:12:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11988 states. [2019-12-27 18:12:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11988 states to 11988 states and 38075 transitions. [2019-12-27 18:12:22,415 INFO L78 Accepts]: Start accepts. Automaton has 11988 states and 38075 transitions. Word has length 11 [2019-12-27 18:12:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:22,416 INFO L462 AbstractCegarLoop]: Abstraction has 11988 states and 38075 transitions. [2019-12-27 18:12:22,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:12:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 11988 states and 38075 transitions. [2019-12-27 18:12:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:12:22,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:22,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:22,419 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:22,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:22,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1194917716, now seen corresponding path program 1 times [2019-12-27 18:12:22,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:22,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179330659] [2019-12-27 18:12:22,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:22,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179330659] [2019-12-27 18:12:22,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:22,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:12:22,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1552833696] [2019-12-27 18:12:22,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:22,512 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:22,515 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:12:22,515 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:22,515 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:22,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:12:22,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:22,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:12:22,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:12:22,517 INFO L87 Difference]: Start difference. First operand 11988 states and 38075 transitions. Second operand 4 states. [2019-12-27 18:12:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:23,276 INFO L93 Difference]: Finished difference Result 14736 states and 46267 transitions. [2019-12-27 18:12:23,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:12:23,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:12:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:23,329 INFO L225 Difference]: With dead ends: 14736 [2019-12-27 18:12:23,329 INFO L226 Difference]: Without dead ends: 14736 [2019-12-27 18:12:23,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:23,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14736 states. [2019-12-27 18:12:23,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14736 to 13160. [2019-12-27 18:12:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13160 states. [2019-12-27 18:12:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 41689 transitions. [2019-12-27 18:12:23,822 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 41689 transitions. Word has length 11 [2019-12-27 18:12:23,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:23,822 INFO L462 AbstractCegarLoop]: Abstraction has 13160 states and 41689 transitions. [2019-12-27 18:12:23,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:12:23,823 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 41689 transitions. [2019-12-27 18:12:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:12:23,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:23,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:23,828 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:23,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:23,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1502155024, now seen corresponding path program 1 times [2019-12-27 18:12:23,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:23,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518077933] [2019-12-27 18:12:23,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:24,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518077933] [2019-12-27 18:12:24,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:24,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:12:24,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1939106404] [2019-12-27 18:12:24,044 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:24,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:24,050 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 39 transitions. [2019-12-27 18:12:24,050 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:24,051 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:24,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:12:24,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:24,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:12:24,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:24,053 INFO L87 Difference]: Start difference. First operand 13160 states and 41689 transitions. Second operand 5 states. [2019-12-27 18:12:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:24,519 INFO L93 Difference]: Finished difference Result 17572 states and 54523 transitions. [2019-12-27 18:12:24,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:12:24,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 18:12:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:24,567 INFO L225 Difference]: With dead ends: 17572 [2019-12-27 18:12:24,567 INFO L226 Difference]: Without dead ends: 17565 [2019-12-27 18:12:24,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:12:24,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17565 states. [2019-12-27 18:12:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17565 to 13105. [2019-12-27 18:12:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13105 states. [2019-12-27 18:12:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13105 states to 13105 states and 41426 transitions. [2019-12-27 18:12:25,224 INFO L78 Accepts]: Start accepts. Automaton has 13105 states and 41426 transitions. Word has length 17 [2019-12-27 18:12:25,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:25,225 INFO L462 AbstractCegarLoop]: Abstraction has 13105 states and 41426 transitions. [2019-12-27 18:12:25,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:12:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 13105 states and 41426 transitions. [2019-12-27 18:12:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:12:25,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:25,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:25,237 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:25,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:25,238 INFO L82 PathProgramCache]: Analyzing trace with hash 933350131, now seen corresponding path program 1 times [2019-12-27 18:12:25,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:25,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814787331] [2019-12-27 18:12:25,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:25,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814787331] [2019-12-27 18:12:25,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:25,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:12:25,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1419618260] [2019-12-27 18:12:25,286 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:25,290 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:25,295 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:12:25,295 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:25,296 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:25,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:12:25,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:25,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:12:25,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:12:25,297 INFO L87 Difference]: Start difference. First operand 13105 states and 41426 transitions. Second operand 3 states. [2019-12-27 18:12:25,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:25,432 INFO L93 Difference]: Finished difference Result 16057 states and 50095 transitions. [2019-12-27 18:12:25,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:12:25,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 18:12:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:25,466 INFO L225 Difference]: With dead ends: 16057 [2019-12-27 18:12:25,466 INFO L226 Difference]: Without dead ends: 16057 [2019-12-27 18:12:25,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:12:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16057 states. [2019-12-27 18:12:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16057 to 14186. [2019-12-27 18:12:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14186 states. [2019-12-27 18:12:25,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 44710 transitions. [2019-12-27 18:12:25,866 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 44710 transitions. Word has length 25 [2019-12-27 18:12:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:25,867 INFO L462 AbstractCegarLoop]: Abstraction has 14186 states and 44710 transitions. [2019-12-27 18:12:25,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:12:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 44710 transitions. [2019-12-27 18:12:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:12:25,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:25,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:25,879 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:25,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:25,880 INFO L82 PathProgramCache]: Analyzing trace with hash 933194542, now seen corresponding path program 1 times [2019-12-27 18:12:25,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:25,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886584825] [2019-12-27 18:12:25,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:25,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886584825] [2019-12-27 18:12:25,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:25,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:12:25,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1504687412] [2019-12-27 18:12:25,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:25,960 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:25,965 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:12:25,965 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:25,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:25,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:12:25,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:25,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:12:25,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:12:25,967 INFO L87 Difference]: Start difference. First operand 14186 states and 44710 transitions. Second operand 4 states. [2019-12-27 18:12:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:26,156 INFO L93 Difference]: Finished difference Result 2296 states and 5226 transitions. [2019-12-27 18:12:26,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:12:26,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:12:26,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:26,164 INFO L225 Difference]: With dead ends: 2296 [2019-12-27 18:12:26,164 INFO L226 Difference]: Without dead ends: 2019 [2019-12-27 18:12:26,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-12-27 18:12:26,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2019. [2019-12-27 18:12:26,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-27 18:12:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4460 transitions. [2019-12-27 18:12:26,200 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4460 transitions. Word has length 25 [2019-12-27 18:12:26,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:26,200 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4460 transitions. [2019-12-27 18:12:26,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:12:26,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4460 transitions. [2019-12-27 18:12:26,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:12:26,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:26,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:26,206 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:26,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:26,207 INFO L82 PathProgramCache]: Analyzing trace with hash -568804126, now seen corresponding path program 1 times [2019-12-27 18:12:26,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:26,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120229928] [2019-12-27 18:12:26,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:26,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120229928] [2019-12-27 18:12:26,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:26,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:12:26,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1630453050] [2019-12-27 18:12:26,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:26,349 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:26,361 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-27 18:12:26,361 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:26,362 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:26,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:12:26,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:26,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:12:26,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:26,363 INFO L87 Difference]: Start difference. First operand 2019 states and 4460 transitions. Second operand 5 states. [2019-12-27 18:12:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:26,412 INFO L93 Difference]: Finished difference Result 416 states and 758 transitions. [2019-12-27 18:12:26,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:12:26,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 18:12:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:26,414 INFO L225 Difference]: With dead ends: 416 [2019-12-27 18:12:26,414 INFO L226 Difference]: Without dead ends: 371 [2019-12-27 18:12:26,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:12:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-27 18:12:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 343. [2019-12-27 18:12:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-27 18:12:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 618 transitions. [2019-12-27 18:12:26,420 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 618 transitions. Word has length 37 [2019-12-27 18:12:26,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:26,421 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 618 transitions. [2019-12-27 18:12:26,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:12:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 618 transitions. [2019-12-27 18:12:26,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:12:26,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:26,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:26,423 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:26,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:26,423 INFO L82 PathProgramCache]: Analyzing trace with hash -506418728, now seen corresponding path program 1 times [2019-12-27 18:12:26,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:26,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247386689] [2019-12-27 18:12:26,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:26,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247386689] [2019-12-27 18:12:26,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:26,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:12:26,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [659199335] [2019-12-27 18:12:26,545 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:26,558 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:26,594 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 112 transitions. [2019-12-27 18:12:26,594 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:26,616 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:12:26,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:12:26,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:26,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:12:26,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:26,617 INFO L87 Difference]: Start difference. First operand 343 states and 618 transitions. Second operand 5 states. [2019-12-27 18:12:26,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:26,763 INFO L93 Difference]: Finished difference Result 438 states and 765 transitions. [2019-12-27 18:12:26,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:12:26,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 18:12:26,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:26,765 INFO L225 Difference]: With dead ends: 438 [2019-12-27 18:12:26,765 INFO L226 Difference]: Without dead ends: 438 [2019-12-27 18:12:26,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:12:26,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-27 18:12:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 331. [2019-12-27 18:12:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-27 18:12:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 582 transitions. [2019-12-27 18:12:26,771 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 582 transitions. Word has length 52 [2019-12-27 18:12:26,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:26,771 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 582 transitions. [2019-12-27 18:12:26,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:12:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 582 transitions. [2019-12-27 18:12:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:12:26,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:26,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:26,773 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:26,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:26,773 INFO L82 PathProgramCache]: Analyzing trace with hash -156128935, now seen corresponding path program 1 times [2019-12-27 18:12:26,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:26,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546779146] [2019-12-27 18:12:26,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:26,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546779146] [2019-12-27 18:12:26,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:26,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:12:26,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1703044021] [2019-12-27 18:12:26,858 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:26,871 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:26,899 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 73 transitions. [2019-12-27 18:12:26,899 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:26,902 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:12:26,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:12:26,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:26,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:12:26,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:26,903 INFO L87 Difference]: Start difference. First operand 331 states and 582 transitions. Second operand 5 states. [2019-12-27 18:12:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:27,096 INFO L93 Difference]: Finished difference Result 487 states and 864 transitions. [2019-12-27 18:12:27,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:12:27,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 18:12:27,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:27,099 INFO L225 Difference]: With dead ends: 487 [2019-12-27 18:12:27,100 INFO L226 Difference]: Without dead ends: 487 [2019-12-27 18:12:27,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:12:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-27 18:12:27,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 422. [2019-12-27 18:12:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-12-27 18:12:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 748 transitions. [2019-12-27 18:12:27,107 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 748 transitions. Word has length 53 [2019-12-27 18:12:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:27,107 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 748 transitions. [2019-12-27 18:12:27,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:12:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 748 transitions. [2019-12-27 18:12:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:12:27,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:27,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:27,109 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:27,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:27,109 INFO L82 PathProgramCache]: Analyzing trace with hash -2022513439, now seen corresponding path program 2 times [2019-12-27 18:12:27,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:27,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814140726] [2019-12-27 18:12:27,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:27,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814140726] [2019-12-27 18:12:27,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:27,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:12:27,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [223520197] [2019-12-27 18:12:27,236 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:27,252 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:27,285 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 89 transitions. [2019-12-27 18:12:27,285 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:27,287 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:27,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:12:27,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:27,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:12:27,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:12:27,288 INFO L87 Difference]: Start difference. First operand 422 states and 748 transitions. Second operand 3 states. [2019-12-27 18:12:27,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:27,338 INFO L93 Difference]: Finished difference Result 422 states and 747 transitions. [2019-12-27 18:12:27,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:12:27,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 18:12:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:27,342 INFO L225 Difference]: With dead ends: 422 [2019-12-27 18:12:27,342 INFO L226 Difference]: Without dead ends: 422 [2019-12-27 18:12:27,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:12:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-27 18:12:27,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 331. [2019-12-27 18:12:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-27 18:12:27,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 581 transitions. [2019-12-27 18:12:27,350 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 581 transitions. Word has length 53 [2019-12-27 18:12:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:27,351 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 581 transitions. [2019-12-27 18:12:27,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:12:27,351 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 581 transitions. [2019-12-27 18:12:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:12:27,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:27,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:27,353 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:27,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:27,354 INFO L82 PathProgramCache]: Analyzing trace with hash -731863498, now seen corresponding path program 1 times [2019-12-27 18:12:27,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:27,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404998111] [2019-12-27 18:12:27,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:27,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404998111] [2019-12-27 18:12:27,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:27,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:12:27,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [689359005] [2019-12-27 18:12:27,643 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:27,658 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:27,687 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 74 transitions. [2019-12-27 18:12:27,688 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:27,688 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:27,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:12:27,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:27,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:12:27,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:12:27,689 INFO L87 Difference]: Start difference. First operand 331 states and 581 transitions. Second operand 7 states. [2019-12-27 18:12:27,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:27,774 INFO L93 Difference]: Finished difference Result 534 states and 938 transitions. [2019-12-27 18:12:27,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:12:27,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 18:12:27,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:27,775 INFO L225 Difference]: With dead ends: 534 [2019-12-27 18:12:27,775 INFO L226 Difference]: Without dead ends: 245 [2019-12-27 18:12:27,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:12:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-12-27 18:12:27,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 221. [2019-12-27 18:12:27,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-27 18:12:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 391 transitions. [2019-12-27 18:12:27,780 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 391 transitions. Word has length 54 [2019-12-27 18:12:27,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:27,780 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 391 transitions. [2019-12-27 18:12:27,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:12:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 391 transitions. [2019-12-27 18:12:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:12:27,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:27,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:27,783 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:27,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:27,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1034362442, now seen corresponding path program 2 times [2019-12-27 18:12:27,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:27,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77282467] [2019-12-27 18:12:27,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:28,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77282467] [2019-12-27 18:12:28,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:28,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:12:28,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1025843381] [2019-12-27 18:12:28,158 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:28,168 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:28,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 115 transitions. [2019-12-27 18:12:28,197 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:28,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:12:28,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:12:28,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:28,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:12:28,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:12:28,383 INFO L87 Difference]: Start difference. First operand 221 states and 391 transitions. Second operand 16 states. [2019-12-27 18:12:29,699 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 24 [2019-12-27 18:12:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:30,506 INFO L93 Difference]: Finished difference Result 566 states and 960 transitions. [2019-12-27 18:12:30,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 18:12:30,507 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2019-12-27 18:12:30,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:30,509 INFO L225 Difference]: With dead ends: 566 [2019-12-27 18:12:30,510 INFO L226 Difference]: Without dead ends: 533 [2019-12-27 18:12:30,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=284, Invalid=1356, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 18:12:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-12-27 18:12:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 321. [2019-12-27 18:12:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-27 18:12:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 562 transitions. [2019-12-27 18:12:30,517 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 562 transitions. Word has length 54 [2019-12-27 18:12:30,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:30,518 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 562 transitions. [2019-12-27 18:12:30,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:12:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 562 transitions. [2019-12-27 18:12:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:12:30,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:30,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:30,519 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:30,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:30,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1326135034, now seen corresponding path program 3 times [2019-12-27 18:12:30,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:30,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491078392] [2019-12-27 18:12:30,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:31,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:31,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491078392] [2019-12-27 18:12:31,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:31,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 18:12:31,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1699124027] [2019-12-27 18:12:31,150 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:31,163 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:31,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 114 transitions. [2019-12-27 18:12:31,197 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:31,517 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 18:12:31,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 18:12:31,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:31,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 18:12:31,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:12:31,519 INFO L87 Difference]: Start difference. First operand 321 states and 562 transitions. Second operand 23 states. [2019-12-27 18:12:33,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:33,365 INFO L93 Difference]: Finished difference Result 597 states and 1022 transitions. [2019-12-27 18:12:33,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 18:12:33,366 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2019-12-27 18:12:33,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:33,367 INFO L225 Difference]: With dead ends: 597 [2019-12-27 18:12:33,368 INFO L226 Difference]: Without dead ends: 564 [2019-12-27 18:12:33,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=212, Invalid=1048, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 18:12:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-12-27 18:12:33,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 347. [2019-12-27 18:12:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-27 18:12:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 612 transitions. [2019-12-27 18:12:33,374 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 612 transitions. Word has length 54 [2019-12-27 18:12:33,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:33,374 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 612 transitions. [2019-12-27 18:12:33,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 18:12:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 612 transitions. [2019-12-27 18:12:33,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:12:33,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:33,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:33,376 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:33,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:33,376 INFO L82 PathProgramCache]: Analyzing trace with hash 404487136, now seen corresponding path program 4 times [2019-12-27 18:12:33,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:33,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391394008] [2019-12-27 18:12:33,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:33,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:33,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391394008] [2019-12-27 18:12:33,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:33,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:12:33,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1064844193] [2019-12-27 18:12:33,591 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:33,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:33,647 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 155 transitions. [2019-12-27 18:12:33,647 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:33,692 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:12:33,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:12:33,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:33,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:12:33,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:12:33,693 INFO L87 Difference]: Start difference. First operand 347 states and 612 transitions. Second operand 13 states. [2019-12-27 18:12:34,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:34,021 INFO L93 Difference]: Finished difference Result 450 states and 766 transitions. [2019-12-27 18:12:34,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:12:34,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 18:12:34,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:34,026 INFO L225 Difference]: With dead ends: 450 [2019-12-27 18:12:34,026 INFO L226 Difference]: Without dead ends: 417 [2019-12-27 18:12:34,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-12-27 18:12:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-12-27 18:12:34,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 329. [2019-12-27 18:12:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 18:12:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 576 transitions. [2019-12-27 18:12:34,032 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 576 transitions. Word has length 54 [2019-12-27 18:12:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:34,032 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 576 transitions. [2019-12-27 18:12:34,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:12:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 576 transitions. [2019-12-27 18:12:34,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:12:34,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:34,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:34,034 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:34,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:34,035 INFO L82 PathProgramCache]: Analyzing trace with hash -91775718, now seen corresponding path program 5 times [2019-12-27 18:12:34,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:34,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178583070] [2019-12-27 18:12:34,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:12:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:12:34,234 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:12:34,234 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:12:34,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff1_thd0~0_329 0) (= v_~y$w_buff0_used~0_834 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2013~0.base_24| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2013~0.base_24|)) (= |v_ULTIMATE.start_main_~#t2013~0.offset_19| 0) (= 0 v_~__unbuffered_cnt~0_61) (= 0 v_~weak$$choice0~0_14) (= v_~y$r_buff1_thd1~0_200 0) (= 0 v_~x~0_147) (= |v_#NULL.offset_3| 0) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2013~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2013~0.base_24|) |v_ULTIMATE.start_main_~#t2013~0.offset_19| 0))) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2013~0.base_24| 1)) (= v_~main$tmp_guard1~0_27 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= 0 v_~y$r_buff1_thd2~0_208) (= 0 v_~y$r_buff0_thd2~0_162) (= v_~y$mem_tmp~0_19 0) (= v_~weak$$choice2~0_141 0) (= v_~y$w_buff1_used~0_547 0) (= v_~y$r_buff0_thd1~0_297 0) (= 0 v_~y$flush_delayed~0_36) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2013~0.base_24|) (= v_~main$tmp_guard0~0_33 0) (= 0 |v_#NULL.base_3|) (= 0 v_~y$w_buff0~0_485) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff0_thd0~0_416 0) (= v_~y~0_146 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~y$w_buff1~0_308 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_41|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_~#t2014~0.base=|v_ULTIMATE.start_main_~#t2014~0.base_19|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_145|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_297, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, #length=|v_#length_13|, ULTIMATE.start_main_~#t2014~0.offset=|v_ULTIMATE.start_main_~#t2014~0.offset_16|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_36|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_21|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_41|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_44|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_38|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_308, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t2013~0.offset=|v_ULTIMATE.start_main_~#t2013~0.offset_19|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_329, ~x~0=v_~x~0_147, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_834, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_33|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_200, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y~0=v_~y~0_146, ULTIMATE.start_main_~#t2013~0.base=|v_ULTIMATE.start_main_~#t2013~0.base_24|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_35|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_208, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_416, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_14|, ~weak$$choice2~0=v_~weak$$choice2~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_~#t2014~0.base, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2014~0.offset, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2013~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t2013~0.base, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:12:34,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L779-1-->L781: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2014~0.base_11|)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2014~0.base_11| 1) |v_#valid_27|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2014~0.base_11|) 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2014~0.base_11| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t2014~0.offset_10| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2014~0.base_11|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2014~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2014~0.base_11|) |v_ULTIMATE.start_main_~#t2014~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2014~0.offset=|v_ULTIMATE.start_main_~#t2014~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2014~0.base=|v_ULTIMATE.start_main_~#t2014~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2014~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2014~0.base] because there is no mapped edge [2019-12-27 18:12:34,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1~0_121 v_~y$w_buff0~0_204) (= 2 v_~y$w_buff0~0_203) (= v_P0Thread1of1ForFork0_~arg.base_96 |v_P0Thread1of1ForFork0_#in~arg.base_96|) (= 0 (mod v_~y$w_buff1_used~0_210 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_P0Thread1of1ForFork0_~arg.offset_96 |v_P0Thread1of1ForFork0_#in~arg.offset_96|) (= v_~y$w_buff0_used~0_350 v_~y$w_buff1_used~0_210) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_~y$w_buff0_used~0_349 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_204, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_349, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$w_buff0~0=v_~y$w_buff0~0_203, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_96, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_96, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_210} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:12:34,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1884319793 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1884319793 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1884319793 |P1Thread1of1ForFork1_#t~ite9_Out-1884319793|)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1884319793| ~y~0_In-1884319793) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1884319793, ~y$w_buff1~0=~y$w_buff1~0_In-1884319793, ~y~0=~y~0_In-1884319793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1884319793} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1884319793, ~y$w_buff1~0=~y$w_buff1~0_In-1884319793, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1884319793|, ~y~0=~y~0_In-1884319793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1884319793} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 18:12:34,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= v_~y~0_41 |v_P1Thread1of1ForFork1_#t~ite9_10|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_10|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_9|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 18:12:34,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1405746107 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1405746107 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1405746107| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1405746107| ~y$w_buff0_used~0_In-1405746107) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1405746107, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1405746107} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1405746107, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1405746107, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1405746107|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:12:34,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-753921305 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-753921305 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-753921305 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-753921305 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-753921305|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-753921305 |P1Thread1of1ForFork1_#t~ite12_Out-753921305|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-753921305, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-753921305, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-753921305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-753921305} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-753921305, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-753921305, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-753921305, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-753921305|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-753921305} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:12:34,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1355077651 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1355077651 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out1355077651| ~y$r_buff0_thd2~0_In1355077651)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out1355077651| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1355077651, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1355077651} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1355077651, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1355077651, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1355077651|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 18:12:34,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2141836608 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In2141836608 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2141836608 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In2141836608 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out2141836608| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite14_Out2141836608| ~y$r_buff1_thd2~0_In2141836608) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2141836608, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2141836608, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2141836608, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2141836608} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2141836608, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2141836608, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2141836608, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2141836608|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2141836608} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:12:34,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~y$r_buff1_thd2~0_91) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_91, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 18:12:34,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-605456676 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-605456676 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-605456676| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-605456676| ~y$w_buff0_used~0_In-605456676) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-605456676, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-605456676} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-605456676|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-605456676, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-605456676} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:12:34,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd1~0_In-585250855 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-585250855 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-585250855 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-585250855 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-585250855| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-585250855 |P0Thread1of1ForFork0_#t~ite6_Out-585250855|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-585250855, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-585250855, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-585250855, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-585250855} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-585250855|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-585250855, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-585250855, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-585250855, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-585250855} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:12:34,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1159362027 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1159362027 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1159362027 ~y$r_buff0_thd1~0_Out-1159362027)) (and (= ~y$r_buff0_thd1~0_Out-1159362027 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1159362027, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1159362027} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1159362027, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1159362027|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1159362027} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:12:34,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-180757142 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-180757142 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-180757142 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-180757142 256) 0))) (or (and (= ~y$r_buff1_thd1~0_In-180757142 |P0Thread1of1ForFork0_#t~ite8_Out-180757142|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-180757142|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-180757142, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-180757142, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-180757142, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-180757142} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-180757142, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-180757142, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-180757142|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-180757142, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-180757142} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:12:34,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L740-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 18:12:34,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 18:12:34,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-918594145 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite17_Out-918594145| |ULTIMATE.start_main_#t~ite18_Out-918594145|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-918594145 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-918594145| ~y~0_In-918594145) .cse2) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite17_Out-918594145| ~y$w_buff1~0_In-918594145) .cse2 (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-918594145, ~y~0=~y~0_In-918594145, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-918594145, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-918594145} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-918594145|, ~y$w_buff1~0=~y$w_buff1~0_In-918594145, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-918594145|, ~y~0=~y~0_In-918594145, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-918594145, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-918594145} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 18:12:34,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1911163144 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1911163144 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out1911163144| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1911163144 |ULTIMATE.start_main_#t~ite19_Out1911163144|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1911163144, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1911163144} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1911163144, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1911163144|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1911163144} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 18:12:34,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-131840910 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-131840910 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-131840910 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-131840910 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-131840910|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite20_Out-131840910| ~y$w_buff1_used~0_In-131840910)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-131840910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-131840910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-131840910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-131840910} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-131840910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-131840910, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-131840910|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-131840910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-131840910} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 18:12:34,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-750256963 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-750256963 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out-750256963|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-750256963 |ULTIMATE.start_main_#t~ite21_Out-750256963|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-750256963, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-750256963} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-750256963, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-750256963, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-750256963|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 18:12:34,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In696432436 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In696432436 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In696432436 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In696432436 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out696432436| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite22_Out696432436| ~y$r_buff1_thd0~0_In696432436) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In696432436, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In696432436, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In696432436, ~y$w_buff1_used~0=~y$w_buff1_used~0_In696432436} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In696432436, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In696432436, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In696432436, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out696432436|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In696432436} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 18:12:34,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L800-->L800-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1764873950 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite32_Out1764873950| ~y$w_buff1~0_In1764873950) (= |ULTIMATE.start_main_#t~ite31_In1764873950| |ULTIMATE.start_main_#t~ite31_Out1764873950|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1764873950 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1764873950 256)) (and (= (mod ~y$w_buff1_used~0_In1764873950 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd0~0_In1764873950 256)) .cse1))) .cse0 (= ~y$w_buff1~0_In1764873950 |ULTIMATE.start_main_#t~ite31_Out1764873950|) (= |ULTIMATE.start_main_#t~ite32_Out1764873950| |ULTIMATE.start_main_#t~ite31_Out1764873950|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1764873950, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1764873950, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1764873950, ~weak$$choice2~0=~weak$$choice2~0_In1764873950, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In1764873950|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1764873950, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1764873950} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1764873950, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1764873950, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1764873950, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1764873950|, ~weak$$choice2~0=~weak$$choice2~0_In1764873950, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1764873950|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1764873950, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1764873950} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 18:12:34,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (= v_~y$r_buff0_thd0~0_162 v_~y$r_buff0_thd0~0_163) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 18:12:34,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_12 256)) (not (= 0 (mod v_~y$flush_delayed~0_25 256))) (= v_~y~0_106 v_~y$mem_tmp~0_13)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_106, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:12:34,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:12:34,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:12:34 BasicIcfg [2019-12-27 18:12:34,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:12:34,350 INFO L168 Benchmark]: Toolchain (without parser) took 21896.89 ms. Allocated memory was 138.9 MB in the beginning and 740.3 MB in the end (delta: 601.4 MB). Free memory was 102.2 MB in the beginning and 429.7 MB in the end (delta: -327.5 MB). Peak memory consumption was 273.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:34,350 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 18:12:34,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.09 ms. Allocated memory was 138.9 MB in the beginning and 205.0 MB in the end (delta: 66.1 MB). Free memory was 102.0 MB in the beginning and 159.7 MB in the end (delta: -57.8 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:34,353 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.72 ms. Allocated memory is still 205.0 MB. Free memory was 159.1 MB in the beginning and 156.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:34,357 INFO L168 Benchmark]: Boogie Preprocessor took 39.46 ms. Allocated memory is still 205.0 MB. Free memory was 156.5 MB in the beginning and 154.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:34,358 INFO L168 Benchmark]: RCFGBuilder took 820.50 ms. Allocated memory is still 205.0 MB. Free memory was 153.8 MB in the beginning and 110.2 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:34,359 INFO L168 Benchmark]: TraceAbstraction took 20195.30 ms. Allocated memory was 205.0 MB in the beginning and 740.3 MB in the end (delta: 535.3 MB). Free memory was 109.6 MB in the beginning and 429.7 MB in the end (delta: -320.1 MB). Peak memory consumption was 215.2 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:34,366 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.09 ms. Allocated memory was 138.9 MB in the beginning and 205.0 MB in the end (delta: 66.1 MB). Free memory was 102.0 MB in the beginning and 159.7 MB in the end (delta: -57.8 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.72 ms. Allocated memory is still 205.0 MB. Free memory was 159.1 MB in the beginning and 156.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.46 ms. Allocated memory is still 205.0 MB. Free memory was 156.5 MB in the beginning and 154.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.50 ms. Allocated memory is still 205.0 MB. Free memory was 153.8 MB in the beginning and 110.2 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20195.30 ms. Allocated memory was 205.0 MB in the beginning and 740.3 MB in the end (delta: 535.3 MB). Free memory was 109.6 MB in the beginning and 429.7 MB in the end (delta: -320.1 MB). Peak memory consumption was 215.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 146 ProgramPointsBefore, 79 ProgramPointsAfterwards, 180 TransitionsBefore, 91 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 3678 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 69 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 46090 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 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 [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 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) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 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) [L799] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 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)) [L800] 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)) [L801] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 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)) [L802] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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)) [L804] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 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)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1449 SDtfs, 1736 SDslu, 4064 SDs, 0 SdLazy, 3071 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 30 SyntacticMatches, 12 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14186occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 9874 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 126291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...