/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:41:44,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:41:44,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:41:44,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:41:44,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:41:44,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:41:44,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:41:44,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:41:44,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:41:44,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:41:44,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:41:44,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:41:44,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:41:44,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:41:44,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:41:44,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:41:44,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:41:44,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:41:44,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:41:44,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:41:44,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:41:44,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:41:44,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:41:44,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:41:44,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:41:44,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:41:44,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:41:44,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:41:44,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:41:44,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:41:44,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:41:44,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:41:44,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:41:44,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:41:44,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:41:44,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:41:44,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:41:44,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:41:44,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:41:44,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:41:44,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:41:44,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-22 00:41:44,279 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:41:44,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:41:44,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:41:44,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:41:44,281 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:41:44,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:41:44,282 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:41:44,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:41:44,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:41:44,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:41:44,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:41:44,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:41:44,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:41:44,284 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:41:44,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:41:44,285 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:41:44,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:41:44,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:41:44,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:41:44,286 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:41:44,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:41:44,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:41:44,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:41:44,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:41:44,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:41:44,287 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:41:44,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:41:44,287 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:41:44,287 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:41:44,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:41:44,288 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:41:44,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:41:44,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:41:44,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:41:44,640 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:41:44,640 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:41:44,641 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2020-10-22 00:41:44,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbc3a911b/923779ffa81d4eb1af20095d06894692/FLAGd9b21f54b [2020-10-22 00:41:45,206 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:41:45,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2020-10-22 00:41:45,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbc3a911b/923779ffa81d4eb1af20095d06894692/FLAGd9b21f54b [2020-10-22 00:41:45,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbc3a911b/923779ffa81d4eb1af20095d06894692 [2020-10-22 00:41:45,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:41:45,463 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:41:45,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:41:45,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:41:45,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:41:45,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:41:45" (1/1) ... [2020-10-22 00:41:45,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7993f11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:45, skipping insertion in model container [2020-10-22 00:41:45,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:41:45" (1/1) ... [2020-10-22 00:41:45,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:41:45,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:41:46,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:41:46,230 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:41:46,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:41:46,383 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:41:46,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:46 WrapperNode [2020-10-22 00:41:46,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:41:46,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:41:46,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:41:46,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:41:46,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:46" (1/1) ... [2020-10-22 00:41:46,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:46" (1/1) ... [2020-10-22 00:41:46,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:41:46,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:41:46,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:41:46,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:41:46,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:46" (1/1) ... [2020-10-22 00:41:46,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:46" (1/1) ... [2020-10-22 00:41:46,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:46" (1/1) ... [2020-10-22 00:41:46,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:46" (1/1) ... [2020-10-22 00:41:46,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:46" (1/1) ... [2020-10-22 00:41:46,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:46" (1/1) ... [2020-10-22 00:41:46,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:46" (1/1) ... [2020-10-22 00:41:46,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:41:46,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:41:46,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:41:46,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:41:46,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:41:46,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:41:46,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 00:41:46,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:41:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:41:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 00:41:46,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 00:41:46,567 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 00:41:46,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 00:41:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 00:41:46,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 00:41:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:41:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 00:41:46,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:41:46,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:41:46,571 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:41:48,519 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:41:48,520 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 00:41:48,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:41:48 BoogieIcfgContainer [2020-10-22 00:41:48,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:41:48,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:41:48,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:41:48,528 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:41:48,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:41:45" (1/3) ... [2020-10-22 00:41:48,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495aee25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:41:48, skipping insertion in model container [2020-10-22 00:41:48,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:46" (2/3) ... [2020-10-22 00:41:48,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495aee25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:41:48, skipping insertion in model container [2020-10-22 00:41:48,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:41:48" (3/3) ... [2020-10-22 00:41:48,532 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_pso.opt.i [2020-10-22 00:41:48,545 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:41:48,545 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:41:48,553 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 00:41:48,554 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:41:48,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,584 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,584 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,586 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,587 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,588 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,588 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,589 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,589 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,589 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,590 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,590 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,590 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,591 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,593 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,597 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,597 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,598 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,602 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,602 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,604 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,604 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:48,607 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:41:48,621 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 00:41:48,643 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:41:48,643 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:41:48,643 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:41:48,643 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:41:48,643 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:41:48,643 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:41:48,644 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:41:48,644 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:41:48,658 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:41:48,659 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-22 00:41:48,662 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-22 00:41:48,664 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow [2020-10-22 00:41:48,714 INFO L129 PetriNetUnfolder]: 3/97 cut-off events. [2020-10-22 00:41:48,715 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:41:48,720 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-10-22 00:41:48,723 INFO L116 LiptonReduction]: Number of co-enabled transitions 1746 [2020-10-22 00:41:49,303 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-22 00:41:49,929 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-22 00:41:50,054 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-22 00:41:51,450 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-22 00:41:51,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-22 00:41:51,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:41:51,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-22 00:41:51,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:41:52,268 WARN L193 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-22 00:41:53,164 WARN L193 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-22 00:41:53,456 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-22 00:41:54,073 WARN L193 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-22 00:41:54,642 WARN L193 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 [2020-10-22 00:41:55,521 WARN L193 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-22 00:41:55,831 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-22 00:41:56,087 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2020-10-22 00:41:56,198 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-22 00:41:56,607 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-22 00:41:56,797 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-22 00:41:56,803 INFO L131 LiptonReduction]: Checked pairs total: 4701 [2020-10-22 00:41:56,803 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-10-22 00:41:56,810 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-22 00:41:56,849 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-22 00:41:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-22 00:41:56,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-22 00:41:56,858 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:56,859 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:56,860 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:56,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash 117480453, now seen corresponding path program 1 times [2020-10-22 00:41:56,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:56,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598071964] [2020-10-22 00:41:56,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:57,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598071964] [2020-10-22 00:41:57,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:57,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:41:57,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [952832914] [2020-10-22 00:41:57,144 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:57,147 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:57,161 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-22 00:41:57,162 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:57,166 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:57,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:41:57,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:57,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:41:57,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:41:57,185 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-22 00:41:57,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:57,260 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-22 00:41:57,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:41:57,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-22 00:41:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:57,282 INFO L225 Difference]: With dead ends: 550 [2020-10-22 00:41:57,283 INFO L226 Difference]: Without dead ends: 450 [2020-10-22 00:41:57,284 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:41:57,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-22 00:41:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-22 00:41:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-22 00:41:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-22 00:41:57,367 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-22 00:41:57,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:57,368 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-22 00:41:57,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:41:57,368 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-22 00:41:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 00:41:57,369 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:57,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:57,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:41:57,370 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:57,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:57,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1229600893, now seen corresponding path program 1 times [2020-10-22 00:41:57,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:57,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732973635] [2020-10-22 00:41:57,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:57,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732973635] [2020-10-22 00:41:57,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:57,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:41:57,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [247268100] [2020-10-22 00:41:57,519 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:57,522 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:57,526 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 00:41:57,526 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:57,527 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:57,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:41:57,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:57,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:41:57,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:41:57,529 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-22 00:41:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:57,569 INFO L93 Difference]: Finished difference Result 445 states and 1339 transitions. [2020-10-22 00:41:57,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:41:57,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 00:41:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:57,582 INFO L225 Difference]: With dead ends: 445 [2020-10-22 00:41:57,582 INFO L226 Difference]: Without dead ends: 445 [2020-10-22 00:41:57,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:41:57,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-22 00:41:57,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2020-10-22 00:41:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-10-22 00:41:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1339 transitions. [2020-10-22 00:41:57,608 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1339 transitions. Word has length 9 [2020-10-22 00:41:57,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:57,608 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 1339 transitions. [2020-10-22 00:41:57,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:41:57,608 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1339 transitions. [2020-10-22 00:41:57,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:41:57,610 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:57,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:57,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:41:57,611 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:57,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:57,611 INFO L82 PathProgramCache]: Analyzing trace with hash -537078437, now seen corresponding path program 1 times [2020-10-22 00:41:57,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:57,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523469920] [2020-10-22 00:41:57,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:57,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523469920] [2020-10-22 00:41:57,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:57,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:41:57,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1606638400] [2020-10-22 00:41:57,678 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:57,680 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:57,682 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-22 00:41:57,682 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:57,683 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:57,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:41:57,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:57,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:41:57,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:41:57,684 INFO L87 Difference]: Start difference. First operand 445 states and 1339 transitions. Second operand 3 states. [2020-10-22 00:41:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:57,703 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-22 00:41:57,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:41:57,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-22 00:41:57,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:57,708 INFO L225 Difference]: With dead ends: 440 [2020-10-22 00:41:57,708 INFO L226 Difference]: Without dead ends: 440 [2020-10-22 00:41:57,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:41:57,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-22 00:41:57,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-22 00:41:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-22 00:41:57,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-22 00:41:57,731 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 10 [2020-10-22 00:41:57,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:57,731 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-22 00:41:57,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:41:57,731 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-22 00:41:57,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:41:57,733 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:57,733 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:57,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:41:57,733 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:57,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:57,734 INFO L82 PathProgramCache]: Analyzing trace with hash -537078871, now seen corresponding path program 1 times [2020-10-22 00:41:57,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:57,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978706633] [2020-10-22 00:41:57,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:57,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:57,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978706633] [2020-10-22 00:41:57,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:57,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:41:57,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [584169722] [2020-10-22 00:41:57,839 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:57,841 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:57,843 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-10-22 00:41:57,844 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:57,879 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 00:41:57,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:57,883 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:41:57,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:57,885 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:57,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:57,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:57,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:57,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:57,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:57,942 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:57,954 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:57,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:57,964 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:58,066 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:58,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:41:58,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:58,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:41:58,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:41:58,068 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 4 states. [2020-10-22 00:41:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:58,111 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-10-22 00:41:58,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:41:58,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-22 00:41:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:58,115 INFO L225 Difference]: With dead ends: 434 [2020-10-22 00:41:58,116 INFO L226 Difference]: Without dead ends: 434 [2020-10-22 00:41:58,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:41:58,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-22 00:41:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-22 00:41:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-22 00:41:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-10-22 00:41:58,171 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-10-22 00:41:58,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:58,171 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-10-22 00:41:58,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:41:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-10-22 00:41:58,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:41:58,174 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:58,175 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:58,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:41:58,175 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:58,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:58,176 INFO L82 PathProgramCache]: Analyzing trace with hash 530435755, now seen corresponding path program 1 times [2020-10-22 00:41:58,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:58,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354060420] [2020-10-22 00:41:58,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:58,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354060420] [2020-10-22 00:41:58,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:58,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:41:58,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [98560564] [2020-10-22 00:41:58,256 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:58,257 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:58,259 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 00:41:58,259 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:58,260 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:58,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:41:58,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:58,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:41:58,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:58,261 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 5 states. [2020-10-22 00:41:58,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:58,342 INFO L93 Difference]: Finished difference Result 599 states and 1720 transitions. [2020-10-22 00:41:58,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:41:58,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-22 00:41:58,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:58,347 INFO L225 Difference]: With dead ends: 599 [2020-10-22 00:41:58,347 INFO L226 Difference]: Without dead ends: 464 [2020-10-22 00:41:58,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:58,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-10-22 00:41:58,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 419. [2020-10-22 00:41:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-10-22 00:41:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1201 transitions. [2020-10-22 00:41:58,362 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 1201 transitions. Word has length 11 [2020-10-22 00:41:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:58,362 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 1201 transitions. [2020-10-22 00:41:58,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:41:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 1201 transitions. [2020-10-22 00:41:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:41:58,367 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:58,367 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:58,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:41:58,368 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:58,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:58,368 INFO L82 PathProgramCache]: Analyzing trace with hash 530436747, now seen corresponding path program 1 times [2020-10-22 00:41:58,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:58,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765866912] [2020-10-22 00:41:58,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:58,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765866912] [2020-10-22 00:41:58,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:58,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:41:58,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [638428206] [2020-10-22 00:41:58,524 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:58,526 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:58,529 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 25 transitions. [2020-10-22 00:41:58,530 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:58,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:58,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:58,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:58,571 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:58,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:58,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:58,584 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:58,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:58,596 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:58,597 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:58,605 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:58,716 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:58,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:41:58,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:58,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:41:58,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:58,718 INFO L87 Difference]: Start difference. First operand 419 states and 1201 transitions. Second operand 5 states. [2020-10-22 00:41:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:58,764 INFO L93 Difference]: Finished difference Result 407 states and 1157 transitions. [2020-10-22 00:41:58,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:41:58,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-22 00:41:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:58,768 INFO L225 Difference]: With dead ends: 407 [2020-10-22 00:41:58,768 INFO L226 Difference]: Without dead ends: 407 [2020-10-22 00:41:58,769 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2020-10-22 00:41:58,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2020-10-22 00:41:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-22 00:41:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1157 transitions. [2020-10-22 00:41:58,781 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1157 transitions. Word has length 11 [2020-10-22 00:41:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:58,782 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1157 transitions. [2020-10-22 00:41:58,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:41:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1157 transitions. [2020-10-22 00:41:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 00:41:58,783 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:58,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:58,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:41:58,784 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:58,784 INFO L82 PathProgramCache]: Analyzing trace with hash -769299944, now seen corresponding path program 1 times [2020-10-22 00:41:58,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:58,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063367577] [2020-10-22 00:41:58,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:58,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063367577] [2020-10-22 00:41:58,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:58,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:41:58,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1912235798] [2020-10-22 00:41:58,860 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:58,861 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:58,866 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 58 transitions. [2020-10-22 00:41:58,866 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:58,880 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 00:41:58,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:58,881 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:41:58,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:58,883 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:58,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:58,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:58,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:58,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:58,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:58,907 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:59,351 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:59,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:41:59,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:59,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:41:59,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:59,353 INFO L87 Difference]: Start difference. First operand 407 states and 1157 transitions. Second operand 5 states. [2020-10-22 00:41:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:59,407 INFO L93 Difference]: Finished difference Result 402 states and 1138 transitions. [2020-10-22 00:41:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:41:59,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-22 00:41:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:59,411 INFO L225 Difference]: With dead ends: 402 [2020-10-22 00:41:59,411 INFO L226 Difference]: Without dead ends: 402 [2020-10-22 00:41:59,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-10-22 00:41:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2020-10-22 00:41:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-10-22 00:41:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1127 transitions. [2020-10-22 00:41:59,424 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1127 transitions. Word has length 12 [2020-10-22 00:41:59,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:59,424 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 1127 transitions. [2020-10-22 00:41:59,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:41:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1127 transitions. [2020-10-22 00:41:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:41:59,426 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:59,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:59,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:41:59,426 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:59,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:59,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1921518076, now seen corresponding path program 1 times [2020-10-22 00:41:59,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:59,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790840433] [2020-10-22 00:41:59,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:59,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790840433] [2020-10-22 00:41:59,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:59,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:41:59,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1406796547] [2020-10-22 00:41:59,544 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:59,546 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:59,552 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 61 transitions. [2020-10-22 00:41:59,553 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:59,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:59,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:59,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:59,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:59,587 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:42:00,299 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [10707#(and (or (<= ~y~0 0) (= ~y~0 1)) (or (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0)) (= ~y$r_buff0_thd0~0 0)), 10708#(and (or (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0)) (= ~y$r_buff0_thd0~0 0))] [2020-10-22 00:42:00,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 00:42:00,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:42:00,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 00:42:00,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:42:00,300 INFO L87 Difference]: Start difference. First operand 398 states and 1127 transitions. Second operand 8 states. [2020-10-22 00:42:00,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:42:00,456 INFO L93 Difference]: Finished difference Result 470 states and 1310 transitions. [2020-10-22 00:42:00,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:42:00,457 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-22 00:42:00,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:42:00,460 INFO L225 Difference]: With dead ends: 470 [2020-10-22 00:42:00,461 INFO L226 Difference]: Without dead ends: 422 [2020-10-22 00:42:00,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-10-22 00:42:00,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-10-22 00:42:00,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 416. [2020-10-22 00:42:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-10-22 00:42:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1156 transitions. [2020-10-22 00:42:00,475 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1156 transitions. Word has length 13 [2020-10-22 00:42:00,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:42:00,476 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1156 transitions. [2020-10-22 00:42:00,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 00:42:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1156 transitions. [2020-10-22 00:42:00,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:42:00,477 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:42:00,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:42:00,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:42:00,477 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:42:00,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:42:00,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1352377110, now seen corresponding path program 1 times [2020-10-22 00:42:00,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:42:00,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643967254] [2020-10-22 00:42:00,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:42:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:42:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:42:00,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643967254] [2020-10-22 00:42:00,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:42:00,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:42:00,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682480135] [2020-10-22 00:42:00,541 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:42:00,543 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:42:00,547 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 30 transitions. [2020-10-22 00:42:00,548 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:42:00,552 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:42:00,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:42:00,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:42:00,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:42:00,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:42:00,553 INFO L87 Difference]: Start difference. First operand 416 states and 1156 transitions. Second operand 4 states. [2020-10-22 00:42:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:42:00,588 INFO L93 Difference]: Finished difference Result 410 states and 1002 transitions. [2020-10-22 00:42:00,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:42:00,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-22 00:42:00,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:42:00,591 INFO L225 Difference]: With dead ends: 410 [2020-10-22 00:42:00,591 INFO L226 Difference]: Without dead ends: 298 [2020-10-22 00:42:00,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:42:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-10-22 00:42:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2020-10-22 00:42:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-10-22 00:42:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 708 transitions. [2020-10-22 00:42:00,601 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 708 transitions. Word has length 13 [2020-10-22 00:42:00,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:42:00,601 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 708 transitions. [2020-10-22 00:42:00,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:42:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 708 transitions. [2020-10-22 00:42:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:42:00,602 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:42:00,602 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:42:00,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:42:00,603 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:42:00,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:42:00,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1882145435, now seen corresponding path program 1 times [2020-10-22 00:42:00,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:42:00,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012798909] [2020-10-22 00:42:00,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:42:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:42:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:42:00,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012798909] [2020-10-22 00:42:00,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:42:00,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:42:00,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1467830592] [2020-10-22 00:42:00,681 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:42:00,683 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:42:00,689 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 33 transitions. [2020-10-22 00:42:00,689 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:42:00,762 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:42:00,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:42:00,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:42:00,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:42:00,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:42:00,764 INFO L87 Difference]: Start difference. First operand 298 states and 708 transitions. Second operand 5 states. [2020-10-22 00:42:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:42:00,819 INFO L93 Difference]: Finished difference Result 245 states and 530 transitions. [2020-10-22 00:42:00,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:42:00,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-22 00:42:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:42:00,821 INFO L225 Difference]: With dead ends: 245 [2020-10-22 00:42:00,821 INFO L226 Difference]: Without dead ends: 186 [2020-10-22 00:42:00,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:42:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-10-22 00:42:00,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2020-10-22 00:42:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-10-22 00:42:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 390 transitions. [2020-10-22 00:42:00,828 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 390 transitions. Word has length 14 [2020-10-22 00:42:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:42:00,828 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 390 transitions. [2020-10-22 00:42:00,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:42:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 390 transitions. [2020-10-22 00:42:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-22 00:42:00,829 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:42:00,829 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:42:00,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:42:00,830 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:42:00,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:42:00,830 INFO L82 PathProgramCache]: Analyzing trace with hash 573655817, now seen corresponding path program 1 times [2020-10-22 00:42:00,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:42:00,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324121400] [2020-10-22 00:42:00,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:42:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:42:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:42:00,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324121400] [2020-10-22 00:42:00,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:42:00,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:42:00,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [935283995] [2020-10-22 00:42:00,964 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:42:00,966 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:42:00,972 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 55 transitions. [2020-10-22 00:42:00,973 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:42:00,990 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13657#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:42:00,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:42:00,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:42:00,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:42:00,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:42:00,992 INFO L87 Difference]: Start difference. First operand 186 states and 390 transitions. Second operand 7 states. [2020-10-22 00:42:01,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:42:01,059 INFO L93 Difference]: Finished difference Result 166 states and 349 transitions. [2020-10-22 00:42:01,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:42:01,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-22 00:42:01,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:42:01,061 INFO L225 Difference]: With dead ends: 166 [2020-10-22 00:42:01,061 INFO L226 Difference]: Without dead ends: 105 [2020-10-22 00:42:01,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:42:01,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-22 00:42:01,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2020-10-22 00:42:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-22 00:42:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 176 transitions. [2020-10-22 00:42:01,065 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 176 transitions. Word has length 16 [2020-10-22 00:42:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:42:01,065 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 176 transitions. [2020-10-22 00:42:01,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:42:01,066 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 176 transitions. [2020-10-22 00:42:01,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:42:01,066 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:42:01,066 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:42:01,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:42:01,067 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:42:01,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:42:01,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2071543388, now seen corresponding path program 1 times [2020-10-22 00:42:01,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:42:01,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061076765] [2020-10-22 00:42:01,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:42:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:42:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:42:01,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061076765] [2020-10-22 00:42:01,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:42:01,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:42:01,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1077777034] [2020-10-22 00:42:01,190 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:42:01,193 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:42:01,213 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 145 transitions. [2020-10-22 00:42:01,213 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:42:01,686 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [14009#(and (= ~__unbuffered_p0_EAX~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0))] [2020-10-22 00:42:01,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-22 00:42:01,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:42:01,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-22 00:42:01,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-22 00:42:01,688 INFO L87 Difference]: Start difference. First operand 87 states and 176 transitions. Second operand 10 states. [2020-10-22 00:42:01,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:42:01,847 INFO L93 Difference]: Finished difference Result 128 states and 254 transitions. [2020-10-22 00:42:01,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-22 00:42:01,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-22 00:42:01,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:42:01,850 INFO L225 Difference]: With dead ends: 128 [2020-10-22 00:42:01,850 INFO L226 Difference]: Without dead ends: 102 [2020-10-22 00:42:01,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-22 00:42:01,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-22 00:42:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2020-10-22 00:42:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-22 00:42:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 177 transitions. [2020-10-22 00:42:01,855 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 177 transitions. Word has length 20 [2020-10-22 00:42:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:42:01,856 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 177 transitions. [2020-10-22 00:42:01,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-22 00:42:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 177 transitions. [2020-10-22 00:42:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:42:01,857 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:42:01,857 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:42:01,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:42:01,857 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:42:01,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:42:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash -2143931996, now seen corresponding path program 2 times [2020-10-22 00:42:01,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:42:01,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124361887] [2020-10-22 00:42:01,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:42:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:42:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:42:01,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124361887] [2020-10-22 00:42:01,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:42:01,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:42:01,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [779775055] [2020-10-22 00:42:01,902 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:42:01,905 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:42:01,923 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 140 transitions. [2020-10-22 00:42:01,924 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:42:02,242 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:42:02,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:42:02,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:42:02,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:42:02,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:42:02,243 INFO L87 Difference]: Start difference. First operand 93 states and 177 transitions. Second operand 4 states. [2020-10-22 00:42:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:42:02,261 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2020-10-22 00:42:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:42:02,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-22 00:42:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:42:02,263 INFO L225 Difference]: With dead ends: 103 [2020-10-22 00:42:02,263 INFO L226 Difference]: Without dead ends: 47 [2020-10-22 00:42:02,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:42:02,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-22 00:42:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-22 00:42:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-22 00:42:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-10-22 00:42:02,265 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 20 [2020-10-22 00:42:02,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:42:02,266 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-10-22 00:42:02,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:42:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-10-22 00:42:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:42:02,266 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:42:02,267 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:42:02,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 00:42:02,267 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:42:02,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:42:02,267 INFO L82 PathProgramCache]: Analyzing trace with hash -7896946, now seen corresponding path program 3 times [2020-10-22 00:42:02,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:42:02,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141724863] [2020-10-22 00:42:02,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:42:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:42:02,308 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:42:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:42:02,338 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:42:02,377 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:42:02,378 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:42:02,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 00:42:02,379 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:42:02,390 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L2-->L831: Formula: (let ((.cse6 (= (mod ~y$r_buff0_thd0~0_In-960791001 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In-960791001 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In-960791001 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In-960791001 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse5 (or .cse6 .cse7)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (= ~y$r_buff0_thd0~0_Out-960791001 ~y$r_buff0_thd0~0_In-960791001) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-960791001 0)) (or (and .cse0 .cse1 (= ~y$w_buff1_used~0_Out-960791001 0)) (and (= ~y$w_buff1_used~0_Out-960791001 ~y$w_buff1_used~0_In-960791001) .cse2)) (or (and (= ~y$w_buff0~0_In-960791001 ~y~0_Out-960791001) .cse3 .cse4) (and .cse5 (or (and (= ~y$w_buff1~0_In-960791001 ~y~0_Out-960791001) .cse0 .cse1) (and .cse2 (= ~y~0_In-960791001 ~y~0_Out-960791001))))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-960791001 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-960791001|) (or (and .cse5 (= ~y$w_buff0_used~0_In-960791001 ~y$w_buff0_used~0_Out-960791001)) (and (= ~y$w_buff0_used~0_Out-960791001 0) .cse3 .cse4)) (= ~y$r_buff1_thd0~0_In-960791001 ~y$r_buff1_thd0~0_Out-960791001)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-960791001|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-960791001, ~y$w_buff1~0=~y$w_buff1~0_In-960791001, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-960791001, ~y$w_buff0~0=~y$w_buff0~0_In-960791001, ~y~0=~y~0_In-960791001, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-960791001, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-960791001} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-960791001, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-960791001|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-960791001|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-960791001|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-960791001|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-960791001|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-960791001|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-960791001|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-960791001, ~y$w_buff1~0=~y$w_buff1~0_In-960791001, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-960791001, ~y$w_buff0~0=~y$w_buff0~0_In-960791001, ~y~0=~y~0_Out-960791001, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-960791001, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-960791001} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-22 00:42:02,396 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,396 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,396 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [777] [2020-10-22 00:42:02,398 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,398 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,399 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,399 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,399 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,403 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,403 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,403 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,404 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,408 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,408 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,409 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,409 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,409 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,414 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,414 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,414 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,414 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,414 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,415 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,415 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,415 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:42:02,416 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:42:02,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:42:02 BasicIcfg [2020-10-22 00:42:02,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:42:02,518 INFO L168 Benchmark]: Toolchain (without parser) took 17061.44 ms. Allocated memory was 140.0 MB in the beginning and 370.7 MB in the end (delta: 230.7 MB). Free memory was 101.9 MB in the beginning and 168.6 MB in the end (delta: -66.7 MB). Peak memory consumption was 164.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:42:02,519 INFO L168 Benchmark]: CDTParser took 3.16 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-22 00:42:02,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 920.03 ms. Allocated memory was 140.0 MB in the beginning and 206.0 MB in the end (delta: 66.1 MB). Free memory was 100.8 MB in the beginning and 159.0 MB in the end (delta: -58.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2020-10-22 00:42:02,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.08 ms. Allocated memory is still 206.0 MB. Free memory was 159.0 MB in the beginning and 155.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-10-22 00:42:02,524 INFO L168 Benchmark]: Boogie Preprocessor took 39.59 ms. Allocated memory is still 206.0 MB. Free memory was 155.5 MB in the beginning and 153.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-22 00:42:02,525 INFO L168 Benchmark]: RCFGBuilder took 2029.34 ms. Allocated memory was 206.0 MB in the beginning and 246.9 MB in the end (delta: 40.9 MB). Free memory was 153.4 MB in the beginning and 183.9 MB in the end (delta: -30.5 MB). Peak memory consumption was 99.6 MB. Max. memory is 7.1 GB. [2020-10-22 00:42:02,526 INFO L168 Benchmark]: TraceAbstraction took 13992.59 ms. Allocated memory was 246.9 MB in the beginning and 370.7 MB in the end (delta: 123.7 MB). Free memory was 183.9 MB in the beginning and 168.6 MB in the end (delta: 15.4 MB). Peak memory consumption was 139.1 MB. Max. memory is 7.1 GB. [2020-10-22 00:42:02,534 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.16 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 920.03 ms. Allocated memory was 140.0 MB in the beginning and 206.0 MB in the end (delta: 66.1 MB). Free memory was 100.8 MB in the beginning and 159.0 MB in the end (delta: -58.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.08 ms. Allocated memory is still 206.0 MB. Free memory was 159.0 MB in the beginning and 155.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.59 ms. Allocated memory is still 206.0 MB. Free memory was 155.5 MB in the beginning and 153.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2029.34 ms. Allocated memory was 206.0 MB in the beginning and 246.9 MB in the end (delta: 40.9 MB). Free memory was 153.4 MB in the beginning and 183.9 MB in the end (delta: -30.5 MB). Peak memory consumption was 99.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13992.59 ms. Allocated memory was 246.9 MB in the beginning and 370.7 MB in the end (delta: 123.7 MB). Free memory was 183.9 MB in the beginning and 168.6 MB in the end (delta: 15.4 MB). Peak memory consumption was 139.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 963 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 67 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.1s, 107 PlacesBefore, 35 PlacesAfterwards, 100 TransitionsBefore, 25 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 4701 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2522; [L816] FCALL, FORK 0 pthread_create(&t2522, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2523; [L818] FCALL, FORK 0 pthread_create(&t2523, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2524; [L820] FCALL, FORK 0 pthread_create(&t2524, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "safe031_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 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 [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 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) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L837] 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) [L837] 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) [L838] 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)) [L838] 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)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] 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)) [L840] 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)) [L840] 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)) [L841] 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)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] 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)) [L841] 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)) [L842] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] 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)) [L843] 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)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe031_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.2s, HoareTripleCheckerStatistics: 296 SDtfs, 291 SDslu, 523 SDs, 0 SdLazy, 315 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 11131 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...