/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:20:06,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:20:06,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:20:06,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:20:06,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:20:06,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:20:06,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:20:06,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:20:06,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:20:06,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:20:06,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:20:06,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:20:06,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:20:06,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:20:06,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:20:06,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:20:06,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:20:06,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:20:06,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:20:06,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:20:06,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:20:06,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:20:06,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:20:06,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:20:06,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:20:06,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:20:06,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:20:06,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:20:06,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:20:06,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:20:06,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:20:06,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:20:06,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:20:06,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:20:06,227 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:20:06,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:20:06,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:20:06,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:20:06,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:20:06,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:20:06,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:20:06,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:20:06,244 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:20:06,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:20:06,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:20:06,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:20:06,245 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:20:06,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:20:06,246 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:20:06,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:20:06,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:20:06,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:20:06,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:20:06,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:20:06,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:20:06,247 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:20:06,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:20:06,247 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:20:06,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:20:06,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:20:06,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:20:06,248 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:20:06,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:20:06,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:20:06,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:20:06,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:20:06,249 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:20:06,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:20:06,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:20:06,250 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:20:06,250 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:20:06,250 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:20:06,250 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:20:06,250 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:20:06,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:20:06,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:20:06,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:20:06,555 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:20:06,556 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:20:06,557 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2019-12-27 21:20:06,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b688be89/0cafb881eadc41dd9f47ea12d1b7a06d/FLAG0c5f6dd46 [2019-12-27 21:20:07,213 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:20:07,214 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2019-12-27 21:20:07,228 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b688be89/0cafb881eadc41dd9f47ea12d1b7a06d/FLAG0c5f6dd46 [2019-12-27 21:20:07,482 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b688be89/0cafb881eadc41dd9f47ea12d1b7a06d [2019-12-27 21:20:07,494 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:20:07,496 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:20:07,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:20:07,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:20:07,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:20:07,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:20:07" (1/1) ... [2019-12-27 21:20:07,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71599c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:07, skipping insertion in model container [2019-12-27 21:20:07,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:20:07" (1/1) ... [2019-12-27 21:20:07,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:20:07,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:20:08,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:20:08,087 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:20:08,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:20:08,247 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:20:08,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:08 WrapperNode [2019-12-27 21:20:08,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:20:08,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:20:08,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:20:08,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:20:08,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:08" (1/1) ... [2019-12-27 21:20:08,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:08" (1/1) ... [2019-12-27 21:20:08,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:20:08,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:20:08,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:20:08,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:20:08,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:08" (1/1) ... [2019-12-27 21:20:08,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:08" (1/1) ... [2019-12-27 21:20:08,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:08" (1/1) ... [2019-12-27 21:20:08,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:08" (1/1) ... [2019-12-27 21:20:08,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:08" (1/1) ... [2019-12-27 21:20:08,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:08" (1/1) ... [2019-12-27 21:20:08,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:08" (1/1) ... [2019-12-27 21:20:08,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:20:08,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:20:08,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:20:08,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:20:08,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:20:08,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:20:08,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:20:08,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:20:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:20:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:20:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:20:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:20:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:20:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:20:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:20:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:20:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:20:08,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:20:08,457 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:20:09,167 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:20:09,167 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:20:09,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:20:09 BoogieIcfgContainer [2019-12-27 21:20:09,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:20:09,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:20:09,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:20:09,174 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:20:09,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:20:07" (1/3) ... [2019-12-27 21:20:09,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283e9b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:20:09, skipping insertion in model container [2019-12-27 21:20:09,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:20:08" (2/3) ... [2019-12-27 21:20:09,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283e9b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:20:09, skipping insertion in model container [2019-12-27 21:20:09,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:20:09" (3/3) ... [2019-12-27 21:20:09,178 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_tso.opt.i [2019-12-27 21:20:09,189 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:20:09,189 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:20:09,197 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:20:09,198 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:20:09,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,236 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,236 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,238 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,239 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,247 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,248 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,248 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,248 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,249 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,259 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,261 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,261 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,266 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,266 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,269 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,269 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:20:09,303 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:20:09,320 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:20:09,321 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:20:09,321 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:20:09,321 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:20:09,321 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:20:09,321 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:20:09,321 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:20:09,321 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:20:09,338 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 21:20:09,340 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 21:20:09,431 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 21:20:09,431 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:20:09,445 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 21:20:09,464 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 21:20:09,562 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 21:20:09,562 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:20:09,571 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 21:20:09,589 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 21:20:09,590 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:20:13,027 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 21:20:13,151 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 21:20:13,170 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48939 [2019-12-27 21:20:13,171 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 21:20:13,173 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 93 transitions [2019-12-27 21:20:14,109 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 17702 states. [2019-12-27 21:20:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 17702 states. [2019-12-27 21:20:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 21:20:14,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:14,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:14,117 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:20:14,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:14,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1021258717, now seen corresponding path program 1 times [2019-12-27 21:20:14,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:14,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237666186] [2019-12-27 21:20:14,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:14,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:20:14,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237666186] [2019-12-27 21:20:14,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:14,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:20:14,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [946113541] [2019-12-27 21:20:14,398 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:14,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:14,417 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 21:20:14,417 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:14,421 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:20:14,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:20:14,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:14,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:20:14,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:20:14,439 INFO L87 Difference]: Start difference. First operand 17702 states. Second operand 3 states. [2019-12-27 21:20:14,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:14,832 INFO L93 Difference]: Finished difference Result 17518 states and 65786 transitions. [2019-12-27 21:20:14,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:20:14,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 21:20:14,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:15,055 INFO L225 Difference]: With dead ends: 17518 [2019-12-27 21:20:15,055 INFO L226 Difference]: Without dead ends: 17154 [2019-12-27 21:20:15,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:20:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states. [2019-12-27 21:20:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2019-12-27 21:20:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17154 states. [2019-12-27 21:20:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 64484 transitions. [2019-12-27 21:20:16,742 INFO L78 Accepts]: Start accepts. Automaton has 17154 states and 64484 transitions. Word has length 7 [2019-12-27 21:20:16,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:16,743 INFO L462 AbstractCegarLoop]: Abstraction has 17154 states and 64484 transitions. [2019-12-27 21:20:16,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:20:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 17154 states and 64484 transitions. [2019-12-27 21:20:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:20:16,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:16,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:16,755 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:20:16,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:16,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1042029575, now seen corresponding path program 1 times [2019-12-27 21:20:16,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:16,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839743076] [2019-12-27 21:20:16,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:20:16,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839743076] [2019-12-27 21:20:16,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:16,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:20:16,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1840885771] [2019-12-27 21:20:16,879 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:16,880 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:16,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 21:20:16,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:16,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:20:16,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:20:16,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:16,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:20:16,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:20:16,924 INFO L87 Difference]: Start difference. First operand 17154 states and 64484 transitions. Second operand 5 states. [2019-12-27 21:20:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:17,609 INFO L93 Difference]: Finished difference Result 26570 states and 95594 transitions. [2019-12-27 21:20:17,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:20:17,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 21:20:17,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:17,716 INFO L225 Difference]: With dead ends: 26570 [2019-12-27 21:20:17,717 INFO L226 Difference]: Without dead ends: 26556 [2019-12-27 21:20:17,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:20:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26556 states. [2019-12-27 21:20:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26556 to 24300. [2019-12-27 21:20:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24300 states. [2019-12-27 21:20:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24300 states to 24300 states and 88453 transitions. [2019-12-27 21:20:19,964 INFO L78 Accepts]: Start accepts. Automaton has 24300 states and 88453 transitions. Word has length 13 [2019-12-27 21:20:19,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:19,964 INFO L462 AbstractCegarLoop]: Abstraction has 24300 states and 88453 transitions. [2019-12-27 21:20:19,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:20:19,965 INFO L276 IsEmpty]: Start isEmpty. Operand 24300 states and 88453 transitions. [2019-12-27 21:20:19,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:20:19,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:19,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:19,968 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:20:19,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:19,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1362987190, now seen corresponding path program 1 times [2019-12-27 21:20:19,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:19,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787720078] [2019-12-27 21:20:19,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:20:20,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787720078] [2019-12-27 21:20:20,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:20,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:20:20,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [983913172] [2019-12-27 21:20:20,053 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:20,055 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:20,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:20:20,058 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:20,058 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:20:20,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:20:20,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:20,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:20:20,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:20:20,061 INFO L87 Difference]: Start difference. First operand 24300 states and 88453 transitions. Second operand 3 states. [2019-12-27 21:20:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:20,142 INFO L93 Difference]: Finished difference Result 13809 states and 43497 transitions. [2019-12-27 21:20:20,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:20:20,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:20:20,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:20,187 INFO L225 Difference]: With dead ends: 13809 [2019-12-27 21:20:20,187 INFO L226 Difference]: Without dead ends: 13809 [2019-12-27 21:20:20,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:20:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13809 states. [2019-12-27 21:20:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13809 to 13809. [2019-12-27 21:20:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-27 21:20:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 43497 transitions. [2019-12-27 21:20:20,541 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 43497 transitions. Word has length 13 [2019-12-27 21:20:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:20,541 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 43497 transitions. [2019-12-27 21:20:20,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:20:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 43497 transitions. [2019-12-27 21:20:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:20:20,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:20,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:20,544 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:20:20,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:20,544 INFO L82 PathProgramCache]: Analyzing trace with hash -824782782, now seen corresponding path program 1 times [2019-12-27 21:20:20,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:20,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931967277] [2019-12-27 21:20:20,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:20:20,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931967277] [2019-12-27 21:20:20,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:20,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:20:20,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [125949125] [2019-12-27 21:20:20,592 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:20,593 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:20,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 21:20:20,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:20,631 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:20:20,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:20:20,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:20,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:20:20,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:20:20,633 INFO L87 Difference]: Start difference. First operand 13809 states and 43497 transitions. Second operand 6 states. [2019-12-27 21:20:20,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:20,671 INFO L93 Difference]: Finished difference Result 2006 states and 4674 transitions. [2019-12-27 21:20:20,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:20:20,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-27 21:20:20,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:20,677 INFO L225 Difference]: With dead ends: 2006 [2019-12-27 21:20:20,677 INFO L226 Difference]: Without dead ends: 2006 [2019-12-27 21:20:20,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:20:20,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-12-27 21:20:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 2006. [2019-12-27 21:20:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2019-12-27 21:20:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 4674 transitions. [2019-12-27 21:20:20,711 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 4674 transitions. Word has length 14 [2019-12-27 21:20:20,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:20,711 INFO L462 AbstractCegarLoop]: Abstraction has 2006 states and 4674 transitions. [2019-12-27 21:20:20,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:20:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 4674 transitions. [2019-12-27 21:20:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:20:20,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:20,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:20,714 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:20:20,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:20,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1888947731, now seen corresponding path program 1 times [2019-12-27 21:20:20,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:20,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888591453] [2019-12-27 21:20:20,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:20:20,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888591453] [2019-12-27 21:20:20,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:20,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:20:20,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1379825029] [2019-12-27 21:20:20,950 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:20,955 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:20,972 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 170 transitions. [2019-12-27 21:20:20,972 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:21,041 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:20:21,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:20:21,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:21,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:20:21,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:20:21,042 INFO L87 Difference]: Start difference. First operand 2006 states and 4674 transitions. Second operand 8 states. [2019-12-27 21:20:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:21,088 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-27 21:20:21,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:20:21,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-12-27 21:20:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:21,092 INFO L225 Difference]: With dead ends: 653 [2019-12-27 21:20:21,092 INFO L226 Difference]: Without dead ends: 653 [2019-12-27 21:20:21,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:20:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-27 21:20:21,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-27 21:20:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-27 21:20:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-27 21:20:21,107 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-27 21:20:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:21,107 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-27 21:20:21,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:20:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-27 21:20:21,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:20:21,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:21,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:21,110 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:20:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:21,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1558229958, now seen corresponding path program 1 times [2019-12-27 21:20:21,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:21,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317292065] [2019-12-27 21:20:21,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:20:21,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317292065] [2019-12-27 21:20:21,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:21,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:20:21,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1285416856] [2019-12-27 21:20:21,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:21,210 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:21,267 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 123 transitions. [2019-12-27 21:20:21,267 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:21,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:20:21,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:20:21,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:21,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:20:21,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:20:21,273 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-27 21:20:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:21,316 INFO L93 Difference]: Finished difference Result 609 states and 1418 transitions. [2019-12-27 21:20:21,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:20:21,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 21:20:21,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:21,323 INFO L225 Difference]: With dead ends: 609 [2019-12-27 21:20:21,323 INFO L226 Difference]: Without dead ends: 609 [2019-12-27 21:20:21,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:20:21,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-27 21:20:21,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-27 21:20:21,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 21:20:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1414 transitions. [2019-12-27 21:20:21,337 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1414 transitions. Word has length 55 [2019-12-27 21:20:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:21,337 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1414 transitions. [2019-12-27 21:20:21,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:20:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1414 transitions. [2019-12-27 21:20:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:20:21,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:21,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:21,340 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:20:21,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1993278178, now seen corresponding path program 1 times [2019-12-27 21:20:21,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:21,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547615833] [2019-12-27 21:20:21,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:20:21,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547615833] [2019-12-27 21:20:21,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:21,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:20:21,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2006644198] [2019-12-27 21:20:21,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:21,475 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:21,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 123 transitions. [2019-12-27 21:20:21,536 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:21,538 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:20:21,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:20:21,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:21,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:20:21,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:20:21,539 INFO L87 Difference]: Start difference. First operand 605 states and 1414 transitions. Second operand 3 states. [2019-12-27 21:20:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:21,586 INFO L93 Difference]: Finished difference Result 609 states and 1411 transitions. [2019-12-27 21:20:21,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:20:21,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 21:20:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:21,588 INFO L225 Difference]: With dead ends: 609 [2019-12-27 21:20:21,588 INFO L226 Difference]: Without dead ends: 609 [2019-12-27 21:20:21,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:20:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-27 21:20:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-27 21:20:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 21:20:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1407 transitions. [2019-12-27 21:20:21,601 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1407 transitions. Word has length 55 [2019-12-27 21:20:21,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:21,602 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1407 transitions. [2019-12-27 21:20:21,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:20:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1407 transitions. [2019-12-27 21:20:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:20:21,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:21,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:21,604 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:20:21,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:21,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1988838358, now seen corresponding path program 1 times [2019-12-27 21:20:21,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:21,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464447237] [2019-12-27 21:20:21,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:20:21,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464447237] [2019-12-27 21:20:21,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:21,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:20:21,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1581216311] [2019-12-27 21:20:21,752 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:21,835 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:21,890 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 123 transitions. [2019-12-27 21:20:21,890 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:21,901 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:20:21,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:20:21,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:21,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:20:21,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:20:21,903 INFO L87 Difference]: Start difference. First operand 605 states and 1407 transitions. Second operand 5 states. [2019-12-27 21:20:22,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:22,105 INFO L93 Difference]: Finished difference Result 894 states and 2079 transitions. [2019-12-27 21:20:22,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:20:22,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 21:20:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:22,107 INFO L225 Difference]: With dead ends: 894 [2019-12-27 21:20:22,107 INFO L226 Difference]: Without dead ends: 894 [2019-12-27 21:20:22,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:20:22,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-27 21:20:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-27 21:20:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-27 21:20:22,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1688 transitions. [2019-12-27 21:20:22,121 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1688 transitions. Word has length 55 [2019-12-27 21:20:22,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:22,122 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1688 transitions. [2019-12-27 21:20:22,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:20:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1688 transitions. [2019-12-27 21:20:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:20:22,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:22,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:22,124 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:20:22,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:22,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2112589232, now seen corresponding path program 2 times [2019-12-27 21:20:22,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:22,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626285771] [2019-12-27 21:20:22,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:20:22,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626285771] [2019-12-27 21:20:22,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:22,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:20:22,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1448590295] [2019-12-27 21:20:22,260 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:22,277 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:22,322 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 111 transitions. [2019-12-27 21:20:22,323 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:22,335 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:20:22,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:20:22,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:22,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:20:22,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:20:22,336 INFO L87 Difference]: Start difference. First operand 719 states and 1688 transitions. Second operand 6 states. [2019-12-27 21:20:22,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:22,683 INFO L93 Difference]: Finished difference Result 990 states and 2305 transitions. [2019-12-27 21:20:22,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:20:22,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 21:20:22,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:22,685 INFO L225 Difference]: With dead ends: 990 [2019-12-27 21:20:22,685 INFO L226 Difference]: Without dead ends: 990 [2019-12-27 21:20:22,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:20:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-12-27 21:20:22,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 781. [2019-12-27 21:20:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-12-27 21:20:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1833 transitions. [2019-12-27 21:20:22,700 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1833 transitions. Word has length 55 [2019-12-27 21:20:22,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:22,700 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 1833 transitions. [2019-12-27 21:20:22,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:20:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1833 transitions. [2019-12-27 21:20:22,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:20:22,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:22,703 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:22,703 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:20:22,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:22,703 INFO L82 PathProgramCache]: Analyzing trace with hash 187307682, now seen corresponding path program 3 times [2019-12-27 21:20:22,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:22,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452931990] [2019-12-27 21:20:22,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:20:22,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452931990] [2019-12-27 21:20:22,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:22,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:20:22,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [557845354] [2019-12-27 21:20:22,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:22,811 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:22,862 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 110 transitions. [2019-12-27 21:20:22,862 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:22,955 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:20:22,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:20:22,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:22,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:20:22,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:20:22,957 INFO L87 Difference]: Start difference. First operand 781 states and 1833 transitions. Second operand 10 states. [2019-12-27 21:20:24,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:24,227 INFO L93 Difference]: Finished difference Result 1772 states and 3911 transitions. [2019-12-27 21:20:24,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 21:20:24,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 21:20:24,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:24,230 INFO L225 Difference]: With dead ends: 1772 [2019-12-27 21:20:24,231 INFO L226 Difference]: Without dead ends: 1772 [2019-12-27 21:20:24,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:20:24,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2019-12-27 21:20:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 841. [2019-12-27 21:20:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-12-27 21:20:24,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1983 transitions. [2019-12-27 21:20:24,253 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1983 transitions. Word has length 55 [2019-12-27 21:20:24,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:24,253 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1983 transitions. [2019-12-27 21:20:24,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:20:24,254 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1983 transitions. [2019-12-27 21:20:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:20:24,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:24,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:24,256 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:20:24,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:24,257 INFO L82 PathProgramCache]: Analyzing trace with hash 869164756, now seen corresponding path program 4 times [2019-12-27 21:20:24,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:24,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323190382] [2019-12-27 21:20:24,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:20:24,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323190382] [2019-12-27 21:20:24,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:24,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:20:24,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1347334214] [2019-12-27 21:20:24,321 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:24,366 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:24,445 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 101 transitions. [2019-12-27 21:20:24,446 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:24,468 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:20:24,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:20:24,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:24,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:20:24,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:20:24,469 INFO L87 Difference]: Start difference. First operand 841 states and 1983 transitions. Second operand 5 states. [2019-12-27 21:20:24,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:24,662 INFO L93 Difference]: Finished difference Result 941 states and 2143 transitions. [2019-12-27 21:20:24,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:20:24,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 21:20:24,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:24,664 INFO L225 Difference]: With dead ends: 941 [2019-12-27 21:20:24,664 INFO L226 Difference]: Without dead ends: 941 [2019-12-27 21:20:24,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:20:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-12-27 21:20:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 739. [2019-12-27 21:20:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-12-27 21:20:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1700 transitions. [2019-12-27 21:20:24,680 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1700 transitions. Word has length 55 [2019-12-27 21:20:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:24,680 INFO L462 AbstractCegarLoop]: Abstraction has 739 states and 1700 transitions. [2019-12-27 21:20:24,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:20:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1700 transitions. [2019-12-27 21:20:24,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 21:20:24,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:24,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:24,684 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:20:24,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:24,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1505935980, now seen corresponding path program 1 times [2019-12-27 21:20:24,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:24,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371948843] [2019-12-27 21:20:24,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:20:24,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371948843] [2019-12-27 21:20:24,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:24,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:20:24,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1642315515] [2019-12-27 21:20:24,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:24,804 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:24,870 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 112 states and 171 transitions. [2019-12-27 21:20:24,871 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:24,872 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:20:24,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:20:24,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:24,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:20:24,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:20:24,873 INFO L87 Difference]: Start difference. First operand 739 states and 1700 transitions. Second operand 3 states. [2019-12-27 21:20:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:24,916 INFO L93 Difference]: Finished difference Result 739 states and 1699 transitions. [2019-12-27 21:20:24,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:20:24,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 21:20:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:24,918 INFO L225 Difference]: With dead ends: 739 [2019-12-27 21:20:24,918 INFO L226 Difference]: Without dead ends: 739 [2019-12-27 21:20:24,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:20:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-12-27 21:20:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 476. [2019-12-27 21:20:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-27 21:20:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1088 transitions. [2019-12-27 21:20:24,927 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1088 transitions. Word has length 56 [2019-12-27 21:20:24,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:24,927 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 1088 transitions. [2019-12-27 21:20:24,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:20:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1088 transitions. [2019-12-27 21:20:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:20:24,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:24,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:24,929 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:20:24,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:24,930 INFO L82 PathProgramCache]: Analyzing trace with hash 693794399, now seen corresponding path program 1 times [2019-12-27 21:20:24,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:24,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852891844] [2019-12-27 21:20:24,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:20:25,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852891844] [2019-12-27 21:20:25,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:25,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:20:25,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1518509546] [2019-12-27 21:20:25,130 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:25,146 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:25,215 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 136 transitions. [2019-12-27 21:20:25,215 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:25,216 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:20:25,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:20:25,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:25,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:20:25,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:20:25,217 INFO L87 Difference]: Start difference. First operand 476 states and 1088 transitions. Second operand 6 states. [2019-12-27 21:20:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:25,311 INFO L93 Difference]: Finished difference Result 785 states and 1685 transitions. [2019-12-27 21:20:25,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:20:25,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 21:20:25,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:25,312 INFO L225 Difference]: With dead ends: 785 [2019-12-27 21:20:25,312 INFO L226 Difference]: Without dead ends: 313 [2019-12-27 21:20:25,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:20:25,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-12-27 21:20:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 280. [2019-12-27 21:20:25,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-27 21:20:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 501 transitions. [2019-12-27 21:20:25,318 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 501 transitions. Word has length 57 [2019-12-27 21:20:25,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:25,318 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 501 transitions. [2019-12-27 21:20:25,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:20:25,318 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 501 transitions. [2019-12-27 21:20:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:20:25,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:25,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:25,319 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:20:25,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:25,320 INFO L82 PathProgramCache]: Analyzing trace with hash 776087573, now seen corresponding path program 2 times [2019-12-27 21:20:25,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:25,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758209861] [2019-12-27 21:20:25,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:20:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:20:25,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758209861] [2019-12-27 21:20:25,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:20:25,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:20:25,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [110156208] [2019-12-27 21:20:25,587 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:20:25,604 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:20:25,677 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 133 transitions. [2019-12-27 21:20:25,677 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:20:25,678 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:20:25,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:20:25,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:20:25,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:20:25,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:20:25,679 INFO L87 Difference]: Start difference. First operand 280 states and 501 transitions. Second operand 13 states. [2019-12-27 21:20:26,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:20:26,171 INFO L93 Difference]: Finished difference Result 468 states and 816 transitions. [2019-12-27 21:20:26,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:20:26,172 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 21:20:26,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:20:26,173 INFO L225 Difference]: With dead ends: 468 [2019-12-27 21:20:26,173 INFO L226 Difference]: Without dead ends: 434 [2019-12-27 21:20:26,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-12-27 21:20:26,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-12-27 21:20:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 388. [2019-12-27 21:20:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-27 21:20:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 686 transitions. [2019-12-27 21:20:26,181 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 686 transitions. Word has length 57 [2019-12-27 21:20:26,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:20:26,181 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 686 transitions. [2019-12-27 21:20:26,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:20:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 686 transitions. [2019-12-27 21:20:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:20:26,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:20:26,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:20:26,183 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:20:26,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:20:26,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1732220053, now seen corresponding path program 3 times [2019-12-27 21:20:26,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:20:26,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604749530] [2019-12-27 21:20:26,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:20:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:20:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:20:26,294 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:20:26,294 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:20:26,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1214~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1214~0.base_25|) |v_ULTIMATE.start_main_~#t1214~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$w_buff1~0_26) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~y$r_buff0_thd2~0_20 0) (= v_~main$tmp_guard0~0_9 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1214~0.base_25| 4)) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~y$r_buff1_thd0~0_51) (= v_~y$w_buff0_used~0_108 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~y$flush_delayed~0_14) (= v_~y$r_buff0_thd3~0_26 0) (= 0 v_~y$w_buff0~0_29) (= v_~y$r_buff1_thd1~0_9 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y$r_buff0_thd0~0_80 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1214~0.base_25|) (= 0 v_~y$read_delayed_var~0.base_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t1214~0.base_25| 1) |v_#valid_62|) (= 0 v_~y$r_buff1_thd2~0_17) (= 0 v_~z~0_9) (= 0 v_~__unbuffered_cnt~0_22) (= v_~y$mem_tmp~0_10 0) (= v_~x~0_12 0) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$r_buff1_thd3~0_19) (= v_~y~0_26 0) (= v_~y$r_buff0_thd1~0_6 0) (= 0 |v_ULTIMATE.start_main_~#t1214~0.offset_19|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1214~0.base_25|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1216~0.base=|v_ULTIMATE.start_main_~#t1216~0.base_25|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_26, ULTIMATE.start_main_~#t1215~0.offset=|v_ULTIMATE.start_main_~#t1215~0.offset_19|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_~#t1216~0.offset=|v_ULTIMATE.start_main_~#t1216~0.offset_19|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_~#t1214~0.offset=|v_ULTIMATE.start_main_~#t1214~0.offset_19|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y~0=v_~y~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, ULTIMATE.start_main_~#t1215~0.base=|v_ULTIMATE.start_main_~#t1215~0.base_25|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_~#t1214~0.base=|v_ULTIMATE.start_main_~#t1214~0.base_25|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_80, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1216~0.base, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1215~0.offset, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1216~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1214~0.offset, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1215~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1214~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:20:26,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-1-->L812: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1215~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1215~0.base_13| 0)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1215~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1215~0.base_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1215~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t1215~0.offset_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1215~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1215~0.base_13|) |v_ULTIMATE.start_main_~#t1215~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1215~0.offset=|v_ULTIMATE.start_main_~#t1215~0.offset_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1215~0.base=|v_ULTIMATE.start_main_~#t1215~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1215~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1215~0.base] because there is no mapped edge [2019-12-27 21:20:26,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L812-1-->L814: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1216~0.base_13|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1216~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1216~0.base_13|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1216~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1216~0.base_13|) |v_ULTIMATE.start_main_~#t1216~0.offset_11| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1216~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1216~0.offset_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1216~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1216~0.base=|v_ULTIMATE.start_main_~#t1216~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1216~0.offset=|v_ULTIMATE.start_main_~#t1216~0.offset_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1216~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1216~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 21:20:26,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= 0 (mod v_~y$w_buff1_used~0_47 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6) (= 1 v_~y$w_buff0_used~0_77) (= 2 v_~y$w_buff0~0_14) (= v_P2Thread1of1ForFork0_~arg.offset_4 |v_P2Thread1of1ForFork0_#in~arg.offset_4|) (= v_P2Thread1of1ForFork0_~arg.base_4 |v_P2Thread1of1ForFork0_#in~arg.base_4|) (= v_~y$w_buff1_used~0_47 v_~y$w_buff0_used~0_78) (= v_~y$w_buff0~0_15 v_~y$w_buff1~0_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_4, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_14, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:20:26,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] P0ENTRY-->P0EXIT: Formula: (and (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_9, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 21:20:26,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-2039299017 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2039299017 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_Out-2039299017| ~y$w_buff0_used~0_In-2039299017) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite11_Out-2039299017| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2039299017, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2039299017} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2039299017, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-2039299017|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2039299017} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 21:20:26,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In811506713 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In811506713 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In811506713 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In811506713 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite12_Out811506713| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite12_Out811506713| ~y$w_buff1_used~0_In811506713) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In811506713, ~y$w_buff0_used~0=~y$w_buff0_used~0_In811506713, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In811506713, ~y$w_buff1_used~0=~y$w_buff1_used~0_In811506713} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In811506713, ~y$w_buff0_used~0=~y$w_buff0_used~0_In811506713, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out811506713|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In811506713, ~y$w_buff1_used~0=~y$w_buff1_used~0_In811506713} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 21:20:26,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In957765738 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In957765738 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In957765738 ~y$r_buff0_thd3~0_Out957765738) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out957765738) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In957765738, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In957765738} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In957765738, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out957765738, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out957765738|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 21:20:26,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In496606571 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In496606571 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In496606571 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In496606571 256)))) (or (and (= ~y$r_buff1_thd3~0_In496606571 |P2Thread1of1ForFork0_#t~ite14_Out496606571|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite14_Out496606571|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In496606571, ~y$w_buff0_used~0=~y$w_buff0_used~0_In496606571, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In496606571, ~y$w_buff1_used~0=~y$w_buff1_used~0_In496606571} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out496606571|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In496606571, ~y$w_buff0_used~0=~y$w_buff0_used~0_In496606571, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In496606571, ~y$w_buff1_used~0=~y$w_buff1_used~0_In496606571} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 21:20:26,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork0_#t~ite14_8|)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 21:20:26,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In169084852 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In169084852 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out169084852| ~y~0_In169084852) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out169084852| ~y$w_buff1~0_In169084852)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In169084852, ~y$w_buff1~0=~y$w_buff1~0_In169084852, ~y~0=~y~0_In169084852, ~y$w_buff1_used~0=~y$w_buff1_used~0_In169084852} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In169084852, ~y$w_buff1~0=~y$w_buff1~0_In169084852, ~y~0=~y~0_In169084852, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out169084852|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In169084852} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:20:26,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_7|, ~y~0=v_~y~0_18, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:20:26,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1309509567 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1309509567 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite5_Out1309509567| 0)) (and (= ~y$w_buff0_used~0_In1309509567 |P1Thread1of1ForFork2_#t~ite5_Out1309509567|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1309509567, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1309509567} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1309509567, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1309509567, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out1309509567|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 21:20:26,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1779619166 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1779619166 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1779619166 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1779619166 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-1779619166|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1779619166 |P1Thread1of1ForFork2_#t~ite6_Out-1779619166|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1779619166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1779619166, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1779619166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1779619166} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1779619166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1779619166, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1779619166, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-1779619166|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1779619166} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 21:20:26,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1269449142 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1269449142 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1269449142 |P1Thread1of1ForFork2_#t~ite7_Out1269449142|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out1269449142|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1269449142, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1269449142} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1269449142, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1269449142, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out1269449142|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 21:20:26,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-877885645 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-877885645 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-877885645 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-877885645 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-877885645 |P1Thread1of1ForFork2_#t~ite8_Out-877885645|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite8_Out-877885645|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-877885645, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-877885645, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-877885645, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-877885645} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-877885645, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-877885645, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-877885645|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-877885645, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-877885645} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:20:26,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 21:20:26,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:20:26,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1859445906 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1859445906 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite19_Out1859445906| |ULTIMATE.start_main_#t~ite18_Out1859445906|))) (or (and (= ~y$w_buff1~0_In1859445906 |ULTIMATE.start_main_#t~ite18_Out1859445906|) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= |ULTIMATE.start_main_#t~ite18_Out1859445906| ~y~0_In1859445906)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1859445906, ~y~0=~y~0_In1859445906, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1859445906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1859445906} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1859445906, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1859445906|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1859445906|, ~y~0=~y~0_In1859445906, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1859445906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1859445906} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:20:26,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-473920871 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-473920871 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite20_Out-473920871| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out-473920871| ~y$w_buff0_used~0_In-473920871)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-473920871, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-473920871} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-473920871, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-473920871, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-473920871|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:20:26,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In581044000 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In581044000 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In581044000 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In581044000 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out581044000| ~y$w_buff1_used~0_In581044000) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite21_Out581044000| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In581044000, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In581044000, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In581044000, ~y$w_buff1_used~0=~y$w_buff1_used~0_In581044000} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In581044000, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In581044000, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out581044000|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In581044000, ~y$w_buff1_used~0=~y$w_buff1_used~0_In581044000} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:20:26,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In138347788 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In138347788 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out138347788| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite22_Out138347788| ~y$r_buff0_thd0~0_In138347788) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In138347788, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In138347788} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In138347788, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In138347788, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out138347788|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:20:26,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1551023760 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1551023760 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1551023760 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1551023760 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In1551023760 |ULTIMATE.start_main_#t~ite23_Out1551023760|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite23_Out1551023760|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1551023760, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1551023760, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1551023760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1551023760} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1551023760, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1551023760, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1551023760, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1551023760|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1551023760} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:20:26,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L833-->L833-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1689524573 256) 0))) (or (and (= ~y$w_buff1~0_In-1689524573 |ULTIMATE.start_main_#t~ite33_Out-1689524573|) (= |ULTIMATE.start_main_#t~ite32_In-1689524573| |ULTIMATE.start_main_#t~ite32_Out-1689524573|) (not .cse0)) (and (= ~y$w_buff1~0_In-1689524573 |ULTIMATE.start_main_#t~ite32_Out-1689524573|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1689524573 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-1689524573 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1689524573 256))) (= 0 (mod ~y$w_buff0_used~0_In-1689524573 256)))) (= |ULTIMATE.start_main_#t~ite33_Out-1689524573| |ULTIMATE.start_main_#t~ite32_Out-1689524573|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1689524573, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1689524573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1689524573, ~weak$$choice2~0=~weak$$choice2~0_In-1689524573, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1689524573, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In-1689524573|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1689524573} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1689524573, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1689524573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1689524573, ~weak$$choice2~0=~weak$$choice2~0_In-1689524573, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1689524573|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1689524573, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-1689524573|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1689524573} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-27 21:20:26,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L834-->L834-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1436415105 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-1436415105| ~y$w_buff0_used~0_In-1436415105) (= |ULTIMATE.start_main_#t~ite35_In-1436415105| |ULTIMATE.start_main_#t~ite35_Out-1436415105|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1436415105 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-1436415105 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1436415105 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1436415105 256) 0)))) (= |ULTIMATE.start_main_#t~ite35_Out-1436415105| ~y$w_buff0_used~0_In-1436415105) .cse0 (= |ULTIMATE.start_main_#t~ite36_Out-1436415105| |ULTIMATE.start_main_#t~ite35_Out-1436415105|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1436415105, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1436415105, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-1436415105|, ~weak$$choice2~0=~weak$$choice2~0_In-1436415105, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1436415105, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1436415105} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1436415105, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1436415105, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1436415105|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1436415105|, ~weak$$choice2~0=~weak$$choice2~0_In-1436415105, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1436415105, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1436415105} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 21:20:26,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L835-->L835-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1068578121 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1068578121| ~y$w_buff1_used~0_In1068578121) .cse0 (= |ULTIMATE.start_main_#t~ite38_Out1068578121| |ULTIMATE.start_main_#t~ite39_Out1068578121|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1068578121 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1068578121 256) 0)) (= (mod ~y$w_buff0_used~0_In1068578121 256) 0) (and (= (mod ~y$w_buff1_used~0_In1068578121 256) 0) .cse1)))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In1068578121| |ULTIMATE.start_main_#t~ite38_Out1068578121|) (= |ULTIMATE.start_main_#t~ite39_Out1068578121| ~y$w_buff1_used~0_In1068578121)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1068578121, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1068578121, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1068578121|, ~weak$$choice2~0=~weak$$choice2~0_In1068578121, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1068578121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1068578121} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1068578121, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1068578121|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1068578121, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1068578121|, ~weak$$choice2~0=~weak$$choice2~0_In1068578121, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1068578121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1068578121} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:20:26,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd0~0_64 v_~y$r_buff0_thd0~0_63)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:20:26,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L839-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_23 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:20:26,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:20:26,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:20:26 BasicIcfg [2019-12-27 21:20:26,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:20:26,392 INFO L168 Benchmark]: Toolchain (without parser) took 18896.23 ms. Allocated memory was 145.2 MB in the beginning and 932.7 MB in the end (delta: 787.5 MB). Free memory was 101.7 MB in the beginning and 275.4 MB in the end (delta: -173.7 MB). Peak memory consumption was 613.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:20:26,393 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:20:26,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.18 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 156.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:20:26,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.13 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:20:26,395 INFO L168 Benchmark]: Boogie Preprocessor took 39.32 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:20:26,396 INFO L168 Benchmark]: RCFGBuilder took 797.31 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 104.2 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:20:26,396 INFO L168 Benchmark]: TraceAbstraction took 17219.75 ms. Allocated memory was 202.9 MB in the beginning and 932.7 MB in the end (delta: 729.8 MB). Free memory was 103.6 MB in the beginning and 275.4 MB in the end (delta: -171.8 MB). Peak memory consumption was 558.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:20:26,400 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 751.18 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 156.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.13 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.32 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 797.31 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 104.2 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17219.75 ms. Allocated memory was 202.9 MB in the beginning and 932.7 MB in the end (delta: 729.8 MB). Free memory was 103.6 MB in the beginning and 275.4 MB in the end (delta: -171.8 MB). Peak memory consumption was 558.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 164 ProgramPointsBefore, 84 ProgramPointsAfterwards, 195 TransitionsBefore, 93 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4106 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48939 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1214, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t1215, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1216, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 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) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 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) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 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 [L752] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 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 [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 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) [L832] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 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)) [L833] 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)) [L834] 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)) [L835] 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)) [L837] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 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)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1449 SDtfs, 1463 SDslu, 3167 SDs, 0 SdLazy, 1924 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 47 SyntacticMatches, 15 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24300occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 4179 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 559 ConstructedInterpolants, 0 QuantifiedInterpolants, 84705 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...