/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/mix031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:54:53,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:54:53,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:54:53,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:54:53,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:54:53,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:54:53,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:54:53,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:54:53,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:54:53,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:54:53,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:54:53,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:54:53,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:54:53,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:54:53,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:54:53,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:54:53,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:54:53,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:54:53,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:54:53,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:54:53,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:54:53,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:54:53,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:54:53,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:54:53,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:54:53,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:54:53,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:54:53,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:54:53,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:54:53,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:54:53,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:54:53,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:54:53,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:54:53,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:54:53,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:54:53,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:54:53,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:54:53,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:54:53,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:54:53,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:54:53,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:54:53,246 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 20:54:53,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:54:53,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:54:53,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:54:53,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:54:53,262 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:54:53,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:54:53,262 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:54:53,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:54:53,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:54:53,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:54:53,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:54:53,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:54:53,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:54:53,264 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:54:53,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:54:53,264 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:54:53,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:54:53,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:54:53,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:54:53,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:54:53,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:54:53,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:54:53,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:54:53,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:54:53,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:54:53,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:54:53,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:54:53,267 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:54:53,267 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:54:53,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:54:53,267 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:54:53,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:54:53,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:54:53,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:54:53,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:54:53,574 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:54:53,575 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:54:53,576 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_power.opt.i [2019-12-27 20:54:53,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c6fd709b/9463cacdce824a9f962b748598958d21/FLAG9e23bd966 [2019-12-27 20:54:54,194 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:54:54,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_power.opt.i [2019-12-27 20:54:54,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c6fd709b/9463cacdce824a9f962b748598958d21/FLAG9e23bd966 [2019-12-27 20:54:54,489 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c6fd709b/9463cacdce824a9f962b748598958d21 [2019-12-27 20:54:54,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:54:54,500 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:54:54,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:54:54,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:54:54,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:54:54,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:54:54" (1/1) ... [2019-12-27 20:54:54,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7215fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:54, skipping insertion in model container [2019-12-27 20:54:54,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:54:54" (1/1) ... [2019-12-27 20:54:54,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:54:54,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:54:55,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:54:55,119 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:54:55,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:54:55,271 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:54:55,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:55 WrapperNode [2019-12-27 20:54:55,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:54:55,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:54:55,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:54:55,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:54:55,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:55" (1/1) ... [2019-12-27 20:54:55,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:55" (1/1) ... [2019-12-27 20:54:55,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:54:55,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:54:55,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:54:55,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:54:55,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:55" (1/1) ... [2019-12-27 20:54:55,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:55" (1/1) ... [2019-12-27 20:54:55,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:55" (1/1) ... [2019-12-27 20:54:55,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:55" (1/1) ... [2019-12-27 20:54:55,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:55" (1/1) ... [2019-12-27 20:54:55,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:55" (1/1) ... [2019-12-27 20:54:55,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:55" (1/1) ... [2019-12-27 20:54:55,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:54:55,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:54:55,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:54:55,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:54:55,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:55" (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 20:54:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:54:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:54:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:54:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:54:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:54:55,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:54:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:54:55,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:54:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:54:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:54:55,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:54:55,435 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 20:54:56,175 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:54:56,175 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:54:56,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:54:56 BoogieIcfgContainer [2019-12-27 20:54:56,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:54:56,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:54:56,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:54:56,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:54:56,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:54:54" (1/3) ... [2019-12-27 20:54:56,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d8a3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:54:56, skipping insertion in model container [2019-12-27 20:54:56,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:54:55" (2/3) ... [2019-12-27 20:54:56,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d8a3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:54:56, skipping insertion in model container [2019-12-27 20:54:56,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:54:56" (3/3) ... [2019-12-27 20:54:56,184 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.opt.i [2019-12-27 20:54:56,194 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:54:56,195 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:54:56,202 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:54:56,203 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:54:56,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,239 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,264 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,264 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,264 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,265 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,265 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,277 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,279 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,285 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,285 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,286 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:54:56,304 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:54:56,326 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:54:56,326 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:54:56,326 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:54:56,327 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:54:56,327 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:54:56,327 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:54:56,327 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:54:56,327 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:54:56,345 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-12-27 20:54:56,347 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-27 20:54:56,450 INFO L132 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-27 20:54:56,451 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:54:56,463 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/128 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 20:54:56,479 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-27 20:54:56,520 INFO L132 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-27 20:54:56,521 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:54:56,526 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/128 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 20:54:56,538 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 20:54:56,539 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:54:58,886 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2019-12-27 20:54:59,761 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-12-27 20:54:59,878 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-27 20:55:00,019 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 20:55:00,146 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 20:55:00,179 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46171 [2019-12-27 20:55:00,180 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-27 20:55:00,182 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 79 transitions [2019-12-27 20:55:00,534 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6786 states. [2019-12-27 20:55:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 6786 states. [2019-12-27 20:55:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 20:55:00,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:00,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 20:55:00,552 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:00,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:00,560 INFO L82 PathProgramCache]: Analyzing trace with hash 687166048, now seen corresponding path program 1 times [2019-12-27 20:55:00,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:00,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833712936] [2019-12-27 20:55:00,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:00,793 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 20:55:00,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833712936] [2019-12-27 20:55:00,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:00,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:55:00,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [790952146] [2019-12-27 20:55:00,797 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:00,802 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:00,815 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 20:55:00,816 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:00,819 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:00,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:00,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:00,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:00,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:00,837 INFO L87 Difference]: Start difference. First operand 6786 states. Second operand 3 states. [2019-12-27 20:55:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:01,128 INFO L93 Difference]: Finished difference Result 6626 states and 22242 transitions. [2019-12-27 20:55:01,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:01,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 20:55:01,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:01,242 INFO L225 Difference]: With dead ends: 6626 [2019-12-27 20:55:01,242 INFO L226 Difference]: Without dead ends: 6242 [2019-12-27 20:55:01,247 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 20:55:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6242 states. [2019-12-27 20:55:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6242 to 6242. [2019-12-27 20:55:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6242 states. [2019-12-27 20:55:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6242 states to 6242 states and 20914 transitions. [2019-12-27 20:55:01,594 INFO L78 Accepts]: Start accepts. Automaton has 6242 states and 20914 transitions. Word has length 5 [2019-12-27 20:55:01,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:01,594 INFO L462 AbstractCegarLoop]: Abstraction has 6242 states and 20914 transitions. [2019-12-27 20:55:01,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:01,594 INFO L276 IsEmpty]: Start isEmpty. Operand 6242 states and 20914 transitions. [2019-12-27 20:55:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:55:01,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:01,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:01,598 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:01,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:01,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1092588283, now seen corresponding path program 1 times [2019-12-27 20:55:01,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:01,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215692134] [2019-12-27 20:55:01,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:01,660 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 20:55:01,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215692134] [2019-12-27 20:55:01,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:01,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:01,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716656338] [2019-12-27 20:55:01,661 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:01,663 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:01,667 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:55:01,667 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:01,668 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:01,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:01,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:01,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:01,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:01,671 INFO L87 Difference]: Start difference. First operand 6242 states and 20914 transitions. Second operand 3 states. [2019-12-27 20:55:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:01,704 INFO L93 Difference]: Finished difference Result 1244 states and 3068 transitions. [2019-12-27 20:55:01,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:01,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 20:55:01,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:01,713 INFO L225 Difference]: With dead ends: 1244 [2019-12-27 20:55:01,713 INFO L226 Difference]: Without dead ends: 1244 [2019-12-27 20:55:01,716 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 20:55:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-12-27 20:55:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1244. [2019-12-27 20:55:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2019-12-27 20:55:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 3068 transitions. [2019-12-27 20:55:01,748 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 3068 transitions. Word has length 11 [2019-12-27 20:55:01,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:01,748 INFO L462 AbstractCegarLoop]: Abstraction has 1244 states and 3068 transitions. [2019-12-27 20:55:01,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 3068 transitions. [2019-12-27 20:55:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:55:01,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:01,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:01,755 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:01,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:01,756 INFO L82 PathProgramCache]: Analyzing trace with hash 97322610, now seen corresponding path program 1 times [2019-12-27 20:55:01,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:01,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518007975] [2019-12-27 20:55:01,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:01,834 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 20:55:01,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518007975] [2019-12-27 20:55:01,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:01,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:01,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1299901233] [2019-12-27 20:55:01,835 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:01,837 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:01,841 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:55:01,841 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:01,902 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:55:01,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:01,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:01,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:01,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:01,904 INFO L87 Difference]: Start difference. First operand 1244 states and 3068 transitions. Second operand 5 states. [2019-12-27 20:55:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:02,024 INFO L93 Difference]: Finished difference Result 1899 states and 4747 transitions. [2019-12-27 20:55:02,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:02,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:55:02,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:02,035 INFO L225 Difference]: With dead ends: 1899 [2019-12-27 20:55:02,036 INFO L226 Difference]: Without dead ends: 1899 [2019-12-27 20:55:02,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:02,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2019-12-27 20:55:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1383. [2019-12-27 20:55:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2019-12-27 20:55:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 3459 transitions. [2019-12-27 20:55:02,085 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 3459 transitions. Word has length 14 [2019-12-27 20:55:02,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:02,085 INFO L462 AbstractCegarLoop]: Abstraction has 1383 states and 3459 transitions. [2019-12-27 20:55:02,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 3459 transitions. [2019-12-27 20:55:02,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:55:02,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:02,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:02,087 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:02,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:02,087 INFO L82 PathProgramCache]: Analyzing trace with hash 234592346, now seen corresponding path program 1 times [2019-12-27 20:55:02,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:02,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070901453] [2019-12-27 20:55:02,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:02,170 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 20:55:02,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070901453] [2019-12-27 20:55:02,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:02,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:02,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1628124055] [2019-12-27 20:55:02,172 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:02,174 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:02,178 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:55:02,179 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:02,194 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:55:02,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:02,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:02,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:02,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:02,195 INFO L87 Difference]: Start difference. First operand 1383 states and 3459 transitions. Second operand 5 states. [2019-12-27 20:55:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:02,465 INFO L93 Difference]: Finished difference Result 1804 states and 4372 transitions. [2019-12-27 20:55:02,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:55:02,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:55:02,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:02,476 INFO L225 Difference]: With dead ends: 1804 [2019-12-27 20:55:02,477 INFO L226 Difference]: Without dead ends: 1804 [2019-12-27 20:55:02,477 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 20:55:02,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2019-12-27 20:55:02,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1672. [2019-12-27 20:55:02,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-12-27 20:55:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 4077 transitions. [2019-12-27 20:55:02,529 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 4077 transitions. Word has length 14 [2019-12-27 20:55:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:02,531 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 4077 transitions. [2019-12-27 20:55:02,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 4077 transitions. [2019-12-27 20:55:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:55:02,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:02,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:55:02,533 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:02,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:02,534 INFO L82 PathProgramCache]: Analyzing trace with hash -489618057, now seen corresponding path program 1 times [2019-12-27 20:55:02,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:02,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637847335] [2019-12-27 20:55:02,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:02,584 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 20:55:02,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637847335] [2019-12-27 20:55:02,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:02,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:02,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2069935627] [2019-12-27 20:55:02,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:02,587 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:02,591 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 20:55:02,592 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:02,615 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:55:02,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:02,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:02,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:02,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:02,617 INFO L87 Difference]: Start difference. First operand 1672 states and 4077 transitions. Second operand 5 states. [2019-12-27 20:55:02,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:02,833 INFO L93 Difference]: Finished difference Result 2061 states and 4940 transitions. [2019-12-27 20:55:02,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:55:02,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:55:02,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:02,848 INFO L225 Difference]: With dead ends: 2061 [2019-12-27 20:55:02,849 INFO L226 Difference]: Without dead ends: 2061 [2019-12-27 20:55:02,849 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 20:55:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2019-12-27 20:55:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1689. [2019-12-27 20:55:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1689 states. [2019-12-27 20:55:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 4121 transitions. [2019-12-27 20:55:02,899 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 4121 transitions. Word has length 14 [2019-12-27 20:55:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:02,900 INFO L462 AbstractCegarLoop]: Abstraction has 1689 states and 4121 transitions. [2019-12-27 20:55:02,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 4121 transitions. [2019-12-27 20:55:02,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:55:02,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:02,903 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 20:55:02,903 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:02,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:02,903 INFO L82 PathProgramCache]: Analyzing trace with hash 266256386, now seen corresponding path program 1 times [2019-12-27 20:55:02,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:02,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311130674] [2019-12-27 20:55:02,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:02,991 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 20:55:02,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311130674] [2019-12-27 20:55:02,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:02,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:02,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1862353760] [2019-12-27 20:55:02,993 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:02,998 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:03,013 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 20:55:03,013 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:03,028 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:55:03,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:55:03,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:03,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:55:03,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:03,029 INFO L87 Difference]: Start difference. First operand 1689 states and 4121 transitions. Second operand 5 states. [2019-12-27 20:55:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:03,065 INFO L93 Difference]: Finished difference Result 735 states and 1676 transitions. [2019-12-27 20:55:03,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:55:03,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 20:55:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:03,071 INFO L225 Difference]: With dead ends: 735 [2019-12-27 20:55:03,071 INFO L226 Difference]: Without dead ends: 735 [2019-12-27 20:55:03,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:03,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-12-27 20:55:03,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 715. [2019-12-27 20:55:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-12-27 20:55:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1636 transitions. [2019-12-27 20:55:03,090 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1636 transitions. Word has length 26 [2019-12-27 20:55:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:03,092 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1636 transitions. [2019-12-27 20:55:03,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:55:03,092 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1636 transitions. [2019-12-27 20:55:03,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:55:03,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:03,095 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] [2019-12-27 20:55:03,095 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:03,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:03,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1261986746, now seen corresponding path program 1 times [2019-12-27 20:55:03,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:03,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893198645] [2019-12-27 20:55:03,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:03,239 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 20:55:03,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893198645] [2019-12-27 20:55:03,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:03,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:55:03,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2065815688] [2019-12-27 20:55:03,241 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:03,254 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:03,288 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 115 transitions. [2019-12-27 20:55:03,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:03,290 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:03,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:55:03,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:03,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:55:03,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:55:03,291 INFO L87 Difference]: Start difference. First operand 715 states and 1636 transitions. Second operand 4 states. [2019-12-27 20:55:03,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:03,311 INFO L93 Difference]: Finished difference Result 1135 states and 2642 transitions. [2019-12-27 20:55:03,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:55:03,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 20:55:03,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:03,314 INFO L225 Difference]: With dead ends: 1135 [2019-12-27 20:55:03,315 INFO L226 Difference]: Without dead ends: 439 [2019-12-27 20:55:03,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:55:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-12-27 20:55:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2019-12-27 20:55:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-12-27 20:55:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1037 transitions. [2019-12-27 20:55:03,328 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1037 transitions. Word has length 41 [2019-12-27 20:55:03,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:03,328 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 1037 transitions. [2019-12-27 20:55:03,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:55:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1037 transitions. [2019-12-27 20:55:03,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:55:03,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:03,334 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] [2019-12-27 20:55:03,335 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:03,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:03,335 INFO L82 PathProgramCache]: Analyzing trace with hash 798425448, now seen corresponding path program 2 times [2019-12-27 20:55:03,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:03,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328152938] [2019-12-27 20:55:03,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:03,446 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 20:55:03,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328152938] [2019-12-27 20:55:03,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:03,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:55:03,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [459559209] [2019-12-27 20:55:03,448 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:03,460 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:03,493 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 76 transitions. [2019-12-27 20:55:03,493 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:03,555 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:55:03,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:55:03,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:03,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:55:03,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:55:03,556 INFO L87 Difference]: Start difference. First operand 439 states and 1037 transitions. Second operand 7 states. [2019-12-27 20:55:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:03,717 INFO L93 Difference]: Finished difference Result 844 states and 1939 transitions. [2019-12-27 20:55:03,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:55:03,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 20:55:03,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:03,721 INFO L225 Difference]: With dead ends: 844 [2019-12-27 20:55:03,721 INFO L226 Difference]: Without dead ends: 548 [2019-12-27 20:55:03,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:55:03,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-12-27 20:55:03,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 488. [2019-12-27 20:55:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-12-27 20:55:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1120 transitions. [2019-12-27 20:55:03,733 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1120 transitions. Word has length 41 [2019-12-27 20:55:03,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:03,733 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 1120 transitions. [2019-12-27 20:55:03,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:55:03,733 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1120 transitions. [2019-12-27 20:55:03,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:55:03,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:03,735 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] [2019-12-27 20:55:03,735 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:03,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:03,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1598750312, now seen corresponding path program 3 times [2019-12-27 20:55:03,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:03,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787986046] [2019-12-27 20:55:03,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:03,879 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 20:55:03,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787986046] [2019-12-27 20:55:03,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:03,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:55:03,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1426958020] [2019-12-27 20:55:03,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:03,890 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:03,919 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 101 transitions. [2019-12-27 20:55:03,919 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:03,930 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:55:03,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:55:03,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:03,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:55:03,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:55:03,932 INFO L87 Difference]: Start difference. First operand 488 states and 1120 transitions. Second operand 6 states. [2019-12-27 20:55:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:04,330 INFO L93 Difference]: Finished difference Result 830 states and 1839 transitions. [2019-12-27 20:55:04,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:55:04,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 20:55:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:04,335 INFO L225 Difference]: With dead ends: 830 [2019-12-27 20:55:04,335 INFO L226 Difference]: Without dead ends: 818 [2019-12-27 20:55:04,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:55:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-12-27 20:55:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 774. [2019-12-27 20:55:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-12-27 20:55:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1733 transitions. [2019-12-27 20:55:04,352 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1733 transitions. Word has length 41 [2019-12-27 20:55:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:04,353 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1733 transitions. [2019-12-27 20:55:04,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:55:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1733 transitions. [2019-12-27 20:55:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 20:55:04,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:04,355 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] [2019-12-27 20:55:04,355 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:04,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:04,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2012611512, now seen corresponding path program 4 times [2019-12-27 20:55:04,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:04,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430369682] [2019-12-27 20:55:04,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:55:04,415 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 20:55:04,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430369682] [2019-12-27 20:55:04,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:55:04,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:55:04,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2142143836] [2019-12-27 20:55:04,416 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:55:04,425 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:55:04,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 86 transitions. [2019-12-27 20:55:04,451 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:55:04,452 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:55:04,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:55:04,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:55:04,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:55:04,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:55:04,453 INFO L87 Difference]: Start difference. First operand 774 states and 1733 transitions. Second operand 3 states. [2019-12-27 20:55:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:55:04,464 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-12-27 20:55:04,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:55:04,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 20:55:04,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:55:04,469 INFO L225 Difference]: With dead ends: 772 [2019-12-27 20:55:04,469 INFO L226 Difference]: Without dead ends: 772 [2019-12-27 20:55:04,470 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 20:55:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-27 20:55:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 707. [2019-12-27 20:55:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-12-27 20:55:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1604 transitions. [2019-12-27 20:55:04,495 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1604 transitions. Word has length 41 [2019-12-27 20:55:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:55:04,498 INFO L462 AbstractCegarLoop]: Abstraction has 707 states and 1604 transitions. [2019-12-27 20:55:04,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:55:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1604 transitions. [2019-12-27 20:55:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:55:04,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:55:04,502 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] [2019-12-27 20:55:04,502 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:55:04,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:55:04,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1633589471, now seen corresponding path program 1 times [2019-12-27 20:55:04,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:55:04,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794697654] [2019-12-27 20:55:04,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:55:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:55:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:55:04,669 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:55:04,670 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:55:04,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~y$r_buff1_thd1~0_42) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= 0 v_~y$w_buff1~0_24) (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~z~0_11 0) (= |v_#NULL.offset_3| 0) (= v_~y$read_delayed~0_8 0) (= 0 v_~y$flush_delayed~0_14) (= 0 v_~x~0_9) (= v_~y$r_buff0_thd2~0_29 0) (= 0 v_~y$r_buff1_thd0~0_24) (= v_~y$w_buff1_used~0_57 0) (= 0 v_~y$w_buff0_used~0_92) (= 0 v_~y$r_buff1_thd2~0_19) (< 0 |v_#StackHeapBarrier_14|) (= (select .cse0 |v_ULTIMATE.start_main_~#t835~0.base_24|) 0) (= v_~y~0_22 0) (= |v_ULTIMATE.start_main_~#t835~0.offset_19| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t835~0.base_24| 1) |v_#valid_40|) (= v_~y$r_buff0_thd0~0_21 0) (= v_~y$r_buff0_thd1~0_69 0) (= 0 v_~y$w_buff0~0_24) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t835~0.base_24| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t835~0.base_24|) |v_ULTIMATE.start_main_~#t835~0.offset_19| 0)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t835~0.base_24|) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~a~0_12 0) (= v_~y$mem_tmp~0_10 0) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~__unbuffered_cnt~0_18) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t835~0.base_24| 4) |v_#length_15|) (= 0 v_~weak$$choice2~0_31) (= v_~__unbuffered_p0_EBX~0_17 0) (= v_~__unbuffered_p1_EBX~0_18 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t835~0.offset=|v_ULTIMATE.start_main_~#t835~0.offset_19|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_92, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_~#t835~0.base=|v_ULTIMATE.start_main_~#t835~0.base_24|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_42, ~a~0=v_~a~0_12, ULTIMATE.start_main_~#t836~0.offset=|v_ULTIMATE.start_main_~#t836~0.offset_15|, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_24, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_69, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_15|, ~y~0=v_~y~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_22|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_10|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_40|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t836~0.base=|v_ULTIMATE.start_main_~#t836~0.base_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_9, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t835~0.offset, ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t835~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ULTIMATE.start_main_~#t836~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t836~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:55:04,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L810-1-->L812: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t836~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t836~0.base_12|) |v_ULTIMATE.start_main_~#t836~0.offset_10| 1)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t836~0.base_12| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t836~0.base_12| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t836~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t836~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t836~0.offset_10|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t836~0.base_12| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t836~0.offset=|v_ULTIMATE.start_main_~#t836~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t836~0.base=|v_ULTIMATE.start_main_~#t836~0.base_12|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t836~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t836~0.base, #length] because there is no mapped edge [2019-12-27 20:55:04,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L5-->L787: Formula: (and (= 1 ~z~0_Out2061880156) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In2061880156)) (= 1 ~y$r_buff0_thd2~0_Out2061880156) (= ~__unbuffered_p1_EBX~0_Out2061880156 ~a~0_In2061880156) (= ~y$r_buff0_thd1~0_In2061880156 ~y$r_buff1_thd1~0_Out2061880156) (= ~y$r_buff1_thd2~0_Out2061880156 ~y$r_buff0_thd2~0_In2061880156) (= ~y$r_buff1_thd0~0_Out2061880156 ~y$r_buff0_thd0~0_In2061880156) (= ~__unbuffered_p1_EAX~0_Out2061880156 ~z~0_Out2061880156)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In2061880156, ~a~0=~a~0_In2061880156, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2061880156, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2061880156, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2061880156} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out2061880156, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In2061880156, ~a~0=~a~0_In2061880156, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out2061880156, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out2061880156, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out2061880156, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2061880156, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out2061880156, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2061880156, ~z~0=~z~0_Out2061880156, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out2061880156} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 20:55:04,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1532548394 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1532548394 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1532548394 |P1Thread1of1ForFork1_#t~ite28_Out1532548394|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out1532548394|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1532548394, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1532548394} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1532548394, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1532548394, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1532548394|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 20:55:04,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In53408592 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In53408592 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In53408592 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In53408592 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In53408592 |P1Thread1of1ForFork1_#t~ite29_Out53408592|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out53408592|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In53408592, ~y$w_buff0_used~0=~y$w_buff0_used~0_In53408592, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In53408592, ~y$w_buff1_used~0=~y$w_buff1_used~0_In53408592} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In53408592, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out53408592|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In53408592, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In53408592, ~y$w_buff1_used~0=~y$w_buff1_used~0_In53408592} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 20:55:04,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_44 v_~y$r_buff0_thd1~0_43) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_9|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_43, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 20:55:04,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L752-->L752-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In2141382301 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In2141382301 256) 0))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd1~0_In2141382301 256))) (= (mod ~y$w_buff0_used~0_In2141382301 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In2141382301 256))))) .cse1 (= ~y$r_buff1_thd1~0_In2141382301 |P0Thread1of1ForFork0_#t~ite23_Out2141382301|) (= |P0Thread1of1ForFork0_#t~ite23_Out2141382301| |P0Thread1of1ForFork0_#t~ite24_Out2141382301|)) (and (= |P0Thread1of1ForFork0_#t~ite23_In2141382301| |P0Thread1of1ForFork0_#t~ite23_Out2141382301|) (not .cse1) (= ~y$r_buff1_thd1~0_In2141382301 |P0Thread1of1ForFork0_#t~ite24_Out2141382301|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2141382301, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2141382301, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2141382301, ~weak$$choice2~0=~weak$$choice2~0_In2141382301, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2141382301, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In2141382301|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2141382301, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2141382301, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2141382301, ~weak$$choice2~0=~weak$$choice2~0_In2141382301, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out2141382301|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out2141382301|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2141382301} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 20:55:04,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= v_~y~0_15 v_~y$mem_tmp~0_4) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 20:55:04,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-438006349 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-438006349 256)))) (or (and (= ~y$r_buff0_thd2~0_Out-438006349 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In-438006349 ~y$r_buff0_thd2~0_Out-438006349) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-438006349, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-438006349} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-438006349|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-438006349, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-438006349} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 20:55:04,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1598169973 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1598169973 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1598169973 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1598169973 256)))) (or (and (= ~y$r_buff1_thd2~0_In-1598169973 |P1Thread1of1ForFork1_#t~ite31_Out-1598169973|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite31_Out-1598169973|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1598169973, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1598169973, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1598169973, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1598169973} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1598169973, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1598169973, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-1598169973|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1598169973, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1598169973} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 20:55:04,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L791-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite31_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 20:55:04,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:55:04,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In2123837780 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2123837780 256) 0))) (or (and (= ~y~0_In2123837780 |ULTIMATE.start_main_#t~ite34_Out2123837780|) (or .cse0 .cse1)) (and (= ~y$w_buff1~0_In2123837780 |ULTIMATE.start_main_#t~ite34_Out2123837780|) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2123837780, ~y~0=~y~0_In2123837780, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2123837780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2123837780} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2123837780, ~y~0=~y~0_In2123837780, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2123837780, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out2123837780|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2123837780} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 20:55:04,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite34_8|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 20:55:04,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In2072333831 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2072333831 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite36_Out2072333831|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out2072333831| ~y$w_buff0_used~0_In2072333831)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2072333831, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2072333831} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2072333831, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2072333831, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out2072333831|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 20:55:04,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In2121152251 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In2121152251 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In2121152251 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2121152251 256) 0))) (or (and (= ~y$w_buff1_used~0_In2121152251 |ULTIMATE.start_main_#t~ite37_Out2121152251|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out2121152251| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2121152251, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2121152251, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2121152251, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121152251} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2121152251, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2121152251, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2121152251|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2121152251, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121152251} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 20:55:04,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In203182598 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In203182598 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out203182598| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out203182598| ~y$r_buff0_thd0~0_In203182598) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In203182598, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In203182598} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In203182598, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In203182598, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out203182598|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 20:55:04,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1781042066 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1781042066 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1781042066 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1781042066 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out-1781042066| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-1781042066 |ULTIMATE.start_main_#t~ite39_Out-1781042066|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1781042066, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1781042066, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1781042066, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1781042066} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1781042066, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1781042066|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1781042066, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1781042066, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1781042066} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 20:55:04,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EBX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite39_12| v_~y$r_buff1_thd0~0_16) (= 1 v_~__unbuffered_p1_EAX~0_10) (= v_~__unbuffered_p1_EBX~0_10 0) (= v_~__unbuffered_p0_EAX~0_8 1) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_8 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:55:04,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:55:04 BasicIcfg [2019-12-27 20:55:04,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:55:04,809 INFO L168 Benchmark]: Toolchain (without parser) took 10309.05 ms. Allocated memory was 138.9 MB in the beginning and 436.2 MB in the end (delta: 297.3 MB). Free memory was 97.5 MB in the beginning and 357.5 MB in the end (delta: -260.0 MB). Peak memory consumption was 280.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:04,809 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.9 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 20:55:04,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.77 ms. Allocated memory was 138.9 MB in the beginning and 198.7 MB in the end (delta: 59.8 MB). Free memory was 97.2 MB in the beginning and 153.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:04,811 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.43 ms. Allocated memory is still 198.7 MB. Free memory was 153.4 MB in the beginning and 150.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:04,811 INFO L168 Benchmark]: Boogie Preprocessor took 40.02 ms. Allocated memory is still 198.7 MB. Free memory was 150.5 MB in the beginning and 148.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:04,812 INFO L168 Benchmark]: RCFGBuilder took 802.48 ms. Allocated memory is still 198.7 MB. Free memory was 148.4 MB in the beginning and 106.5 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:04,813 INFO L168 Benchmark]: TraceAbstraction took 8629.18 ms. Allocated memory was 198.7 MB in the beginning and 436.2 MB in the end (delta: 237.5 MB). Free memory was 106.5 MB in the beginning and 357.5 MB in the end (delta: -250.9 MB). Peak memory consumption was 229.4 MB. Max. memory is 7.1 GB. [2019-12-27 20:55:04,816 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.25 ms. Allocated memory is still 138.9 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 770.77 ms. Allocated memory was 138.9 MB in the beginning and 198.7 MB in the end (delta: 59.8 MB). Free memory was 97.2 MB in the beginning and 153.4 MB in the end (delta: -56.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.43 ms. Allocated memory is still 198.7 MB. Free memory was 153.4 MB in the beginning and 150.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.02 ms. Allocated memory is still 198.7 MB. Free memory was 150.5 MB in the beginning and 148.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 802.48 ms. Allocated memory is still 198.7 MB. Free memory was 148.4 MB in the beginning and 106.5 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8629.18 ms. Allocated memory was 198.7 MB in the beginning and 436.2 MB in the end (delta: 237.5 MB). Free memory was 106.5 MB in the beginning and 357.5 MB in the end (delta: -250.9 MB). Peak memory consumption was 229.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 139 ProgramPointsBefore, 68 ProgramPointsAfterwards, 167 TransitionsBefore, 79 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 20 ChoiceCompositions, 4338 VarBasedMoverChecksPositive, 128 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 46171 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 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 [L818] 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 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 [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.3s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1042 SDtfs, 778 SDslu, 1940 SDs, 0 SdLazy, 863 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6786occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 1209 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 25542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...