/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:25:10,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:25:10,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:25:10,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:25:10,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:25:10,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:25:10,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:25:10,212 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:25:10,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:25:10,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:25:10,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:25:10,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:25:10,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:25:10,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:25:10,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:25:10,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:25:10,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:25:10,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:25:10,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:25:10,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:25:10,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:25:10,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:25:10,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:25:10,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:25:10,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:25:10,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:25:10,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:25:10,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:25:10,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:25:10,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:25:10,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:25:10,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:25:10,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:25:10,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:25:10,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:25:10,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:25:10,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:25:10,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:25:10,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:25:10,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:25:10,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:25:10,251 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:25:10,276 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:25:10,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:25:10,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:25:10,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:25:10,278 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:25:10,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:25:10,279 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:25:10,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:25:10,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:25:10,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:25:10,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:25:10,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:25:10,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:25:10,281 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:25:10,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:25:10,282 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:25:10,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:25:10,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:25:10,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:25:10,283 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:25:10,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:25:10,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:25:10,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:25:10,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:25:10,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:25:10,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:25:10,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:25:10,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:25:10,285 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:25:10,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:25:10,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:25:10,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:25:10,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:25:10,567 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:25:10,567 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:25:10,568 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2019-12-18 13:25:10,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcf9d930/8b19b846340a4861b7a3b6055513dc4b/FLAG632a040aa [2019-12-18 13:25:11,209 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:25:11,209 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2019-12-18 13:25:11,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcf9d930/8b19b846340a4861b7a3b6055513dc4b/FLAG632a040aa [2019-12-18 13:25:11,457 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbcf9d930/8b19b846340a4861b7a3b6055513dc4b [2019-12-18 13:25:11,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:25:11,474 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:25:11,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:25:11,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:25:11,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:25:11,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:25:11" (1/1) ... [2019-12-18 13:25:11,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c95312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:11, skipping insertion in model container [2019-12-18 13:25:11,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:25:11" (1/1) ... [2019-12-18 13:25:11,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:25:11,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:25:12,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:25:12,153 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:25:12,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:25:12,301 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:25:12,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:12 WrapperNode [2019-12-18 13:25:12,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:25:12,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:25:12,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:25:12,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:25:12,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:12" (1/1) ... [2019-12-18 13:25:12,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:12" (1/1) ... [2019-12-18 13:25:12,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:25:12,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:25:12,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:25:12,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:25:12,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:12" (1/1) ... [2019-12-18 13:25:12,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:12" (1/1) ... [2019-12-18 13:25:12,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:12" (1/1) ... [2019-12-18 13:25:12,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:12" (1/1) ... [2019-12-18 13:25:12,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:12" (1/1) ... [2019-12-18 13:25:12,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:12" (1/1) ... [2019-12-18 13:25:12,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:12" (1/1) ... [2019-12-18 13:25:12,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:25:12,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:25:12,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:25:12,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:25:12,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:12" (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-18 13:25:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:25:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:25:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:25:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:25:12,497 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:25:12,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:25:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:25:12,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:25:12,498 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:25:12,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:25:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:25:12,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:25:12,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:25:12,501 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:25:13,276 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:25:13,276 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:25:13,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:25:13 BoogieIcfgContainer [2019-12-18 13:25:13,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:25:13,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:25:13,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:25:13,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:25:13,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:25:11" (1/3) ... [2019-12-18 13:25:13,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b15273f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:25:13, skipping insertion in model container [2019-12-18 13:25:13,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:25:12" (2/3) ... [2019-12-18 13:25:13,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b15273f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:25:13, skipping insertion in model container [2019-12-18 13:25:13,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:25:13" (3/3) ... [2019-12-18 13:25:13,286 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2019-12-18 13:25:13,296 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:25:13,296 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:25:13,304 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:25:13,305 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:25:13,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,353 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,360 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,360 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,393 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,393 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,396 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,397 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,397 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,402 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,402 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:25:13,419 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:25:13,436 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:25:13,436 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:25:13,436 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:25:13,436 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:25:13,436 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:25:13,436 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:25:13,436 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:25:13,436 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:25:13,454 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 13:25:13,456 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 13:25:13,547 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 13:25:13,548 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:25:13,567 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:25:13,594 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 13:25:13,685 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 13:25:13,686 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:25:13,698 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:25:13,721 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 13:25:13,722 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:25:18,491 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 13:25:18,624 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 13:25:18,668 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83692 [2019-12-18 13:25:18,668 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 13:25:18,672 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 109 transitions [2019-12-18 13:25:41,263 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129810 states. [2019-12-18 13:25:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 129810 states. [2019-12-18 13:25:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 13:25:41,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:41,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 13:25:41,273 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:41,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:41,280 INFO L82 PathProgramCache]: Analyzing trace with hash 817279571, now seen corresponding path program 1 times [2019-12-18 13:25:41,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:41,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754371962] [2019-12-18 13:25:41,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:41,573 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-18 13:25:41,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754371962] [2019-12-18 13:25:41,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:41,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:25:41,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711295565] [2019-12-18 13:25:41,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:25:41,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:41,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:25:41,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:25:41,606 INFO L87 Difference]: Start difference. First operand 129810 states. Second operand 3 states. [2019-12-18 13:25:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:25:43,174 INFO L93 Difference]: Finished difference Result 129322 states and 554746 transitions. [2019-12-18 13:25:43,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:25:43,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 13:25:43,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:25:47,250 INFO L225 Difference]: With dead ends: 129322 [2019-12-18 13:25:47,251 INFO L226 Difference]: Without dead ends: 126774 [2019-12-18 13:25:47,252 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-18 13:25:52,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126774 states. [2019-12-18 13:25:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126774 to 126774. [2019-12-18 13:25:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126774 states. [2019-12-18 13:25:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126774 states to 126774 states and 544358 transitions. [2019-12-18 13:25:58,984 INFO L78 Accepts]: Start accepts. Automaton has 126774 states and 544358 transitions. Word has length 5 [2019-12-18 13:25:58,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:25:58,984 INFO L462 AbstractCegarLoop]: Abstraction has 126774 states and 544358 transitions. [2019-12-18 13:25:58,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:25:58,985 INFO L276 IsEmpty]: Start isEmpty. Operand 126774 states and 544358 transitions. [2019-12-18 13:25:58,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:25:58,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:25:58,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:25:58,990 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:25:58,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:25:58,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1829592591, now seen corresponding path program 1 times [2019-12-18 13:25:58,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:25:58,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141305752] [2019-12-18 13:25:58,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:25:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:25:59,137 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-18 13:25:59,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141305752] [2019-12-18 13:25:59,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:25:59,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:25:59,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092009099] [2019-12-18 13:25:59,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:25:59,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:25:59,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:25:59,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:25:59,141 INFO L87 Difference]: Start difference. First operand 126774 states and 544358 transitions. Second operand 4 states. [2019-12-18 13:26:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:05,181 INFO L93 Difference]: Finished difference Result 198214 states and 818020 transitions. [2019-12-18 13:26:05,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:26:05,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:26:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:05,848 INFO L225 Difference]: With dead ends: 198214 [2019-12-18 13:26:05,849 INFO L226 Difference]: Without dead ends: 198165 [2019-12-18 13:26:05,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:26:12,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198165 states. [2019-12-18 13:26:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198165 to 183268. [2019-12-18 13:26:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183268 states. [2019-12-18 13:26:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183268 states to 183268 states and 763968 transitions. [2019-12-18 13:26:23,892 INFO L78 Accepts]: Start accepts. Automaton has 183268 states and 763968 transitions. Word has length 11 [2019-12-18 13:26:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:23,892 INFO L462 AbstractCegarLoop]: Abstraction has 183268 states and 763968 transitions. [2019-12-18 13:26:23,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:26:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand 183268 states and 763968 transitions. [2019-12-18 13:26:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:26:23,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:23,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:23,904 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:23,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:23,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1837025859, now seen corresponding path program 1 times [2019-12-18 13:26:23,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:23,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167562185] [2019-12-18 13:26:23,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:23,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-18 13:26:23,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167562185] [2019-12-18 13:26:23,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:23,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:26:23,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624688490] [2019-12-18 13:26:23,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:26:23,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:23,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:26:23,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:26:23,994 INFO L87 Difference]: Start difference. First operand 183268 states and 763968 transitions. Second operand 4 states. [2019-12-18 13:26:27,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:27,157 INFO L93 Difference]: Finished difference Result 261626 states and 1065461 transitions. [2019-12-18 13:26:27,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:26:27,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 13:26:27,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:28,098 INFO L225 Difference]: With dead ends: 261626 [2019-12-18 13:26:28,099 INFO L226 Difference]: Without dead ends: 261563 [2019-12-18 13:26:28,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:26:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261563 states. [2019-12-18 13:26:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261563 to 223048. [2019-12-18 13:26:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223048 states. [2019-12-18 13:26:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223048 states to 223048 states and 922460 transitions. [2019-12-18 13:26:48,515 INFO L78 Accepts]: Start accepts. Automaton has 223048 states and 922460 transitions. Word has length 13 [2019-12-18 13:26:48,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:48,516 INFO L462 AbstractCegarLoop]: Abstraction has 223048 states and 922460 transitions. [2019-12-18 13:26:48,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:26:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 223048 states and 922460 transitions. [2019-12-18 13:26:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:26:48,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:48,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:48,520 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:48,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:48,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2085785430, now seen corresponding path program 1 times [2019-12-18 13:26:48,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:48,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904185360] [2019-12-18 13:26:48,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:48,602 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-18 13:26:48,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904185360] [2019-12-18 13:26:48,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:48,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:26:48,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071922335] [2019-12-18 13:26:48,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:26:48,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:48,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:26:48,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:26:48,607 INFO L87 Difference]: Start difference. First operand 223048 states and 922460 transitions. Second operand 4 states. [2019-12-18 13:26:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:48,790 INFO L93 Difference]: Finished difference Result 48374 states and 159119 transitions. [2019-12-18 13:26:48,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:26:48,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 13:26:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:48,861 INFO L225 Difference]: With dead ends: 48374 [2019-12-18 13:26:48,861 INFO L226 Difference]: Without dead ends: 43292 [2019-12-18 13:26:48,861 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-18 13:26:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43292 states. [2019-12-18 13:26:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43292 to 43292. [2019-12-18 13:26:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43292 states. [2019-12-18 13:26:55,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43292 states to 43292 states and 140285 transitions. [2019-12-18 13:26:55,611 INFO L78 Accepts]: Start accepts. Automaton has 43292 states and 140285 transitions. Word has length 13 [2019-12-18 13:26:55,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:55,611 INFO L462 AbstractCegarLoop]: Abstraction has 43292 states and 140285 transitions. [2019-12-18 13:26:55,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:26:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 43292 states and 140285 transitions. [2019-12-18 13:26:55,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 13:26:55,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:55,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:55,616 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:55,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:55,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1321310855, now seen corresponding path program 1 times [2019-12-18 13:26:55,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:55,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291560768] [2019-12-18 13:26:55,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:55,782 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-18 13:26:55,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291560768] [2019-12-18 13:26:55,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:55,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:26:55,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135021199] [2019-12-18 13:26:55,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:26:55,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:55,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:26:55,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:26:55,785 INFO L87 Difference]: Start difference. First operand 43292 states and 140285 transitions. Second operand 7 states. [2019-12-18 13:26:56,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:56,718 INFO L93 Difference]: Finished difference Result 58519 states and 184324 transitions. [2019-12-18 13:26:56,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:26:56,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 13:26:56,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:56,812 INFO L225 Difference]: With dead ends: 58519 [2019-12-18 13:26:56,812 INFO L226 Difference]: Without dead ends: 58416 [2019-12-18 13:26:56,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:26:57,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58416 states. [2019-12-18 13:26:57,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58416 to 43617. [2019-12-18 13:26:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43617 states. [2019-12-18 13:26:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43617 states to 43617 states and 141236 transitions. [2019-12-18 13:26:58,015 INFO L78 Accepts]: Start accepts. Automaton has 43617 states and 141236 transitions. Word has length 19 [2019-12-18 13:26:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:26:58,016 INFO L462 AbstractCegarLoop]: Abstraction has 43617 states and 141236 transitions. [2019-12-18 13:26:58,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:26:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 43617 states and 141236 transitions. [2019-12-18 13:26:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 13:26:58,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:26:58,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:26:58,020 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:26:58,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:26:58,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1425104019, now seen corresponding path program 2 times [2019-12-18 13:26:58,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:26:58,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280421661] [2019-12-18 13:26:58,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:26:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:26:58,158 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-18 13:26:58,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280421661] [2019-12-18 13:26:58,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:26:58,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:26:58,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122934695] [2019-12-18 13:26:58,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:26:58,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:26:58,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:26:58,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:26:58,161 INFO L87 Difference]: Start difference. First operand 43617 states and 141236 transitions. Second operand 6 states. [2019-12-18 13:26:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:26:59,290 INFO L93 Difference]: Finished difference Result 58853 states and 185765 transitions. [2019-12-18 13:26:59,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:26:59,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-18 13:26:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:26:59,412 INFO L225 Difference]: With dead ends: 58853 [2019-12-18 13:26:59,413 INFO L226 Difference]: Without dead ends: 58725 [2019-12-18 13:26:59,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:26:59,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58725 states. [2019-12-18 13:27:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58725 to 43113. [2019-12-18 13:27:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43113 states. [2019-12-18 13:27:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43113 states to 43113 states and 139636 transitions. [2019-12-18 13:27:00,764 INFO L78 Accepts]: Start accepts. Automaton has 43113 states and 139636 transitions. Word has length 19 [2019-12-18 13:27:00,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:27:00,765 INFO L462 AbstractCegarLoop]: Abstraction has 43113 states and 139636 transitions. [2019-12-18 13:27:00,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:27:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 43113 states and 139636 transitions. [2019-12-18 13:27:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:27:00,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:27:00,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:27:00,775 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:27:00,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:27:00,775 INFO L82 PathProgramCache]: Analyzing trace with hash 19935376, now seen corresponding path program 1 times [2019-12-18 13:27:00,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:27:00,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733284541] [2019-12-18 13:27:00,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:27:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:27:00,898 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-18 13:27:00,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733284541] [2019-12-18 13:27:00,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:27:00,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:27:00,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739703938] [2019-12-18 13:27:00,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:27:00,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:27:00,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:27:00,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:27:00,900 INFO L87 Difference]: Start difference. First operand 43113 states and 139636 transitions. Second operand 5 states. [2019-12-18 13:27:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:27:01,426 INFO L93 Difference]: Finished difference Result 58208 states and 184925 transitions. [2019-12-18 13:27:01,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:27:01,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 13:27:01,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:27:01,516 INFO L225 Difference]: With dead ends: 58208 [2019-12-18 13:27:01,516 INFO L226 Difference]: Without dead ends: 58208 [2019-12-18 13:27:01,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:27:01,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58208 states. [2019-12-18 13:27:02,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58208 to 47428. [2019-12-18 13:27:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47428 states. [2019-12-18 13:27:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47428 states to 47428 states and 152707 transitions. [2019-12-18 13:27:02,784 INFO L78 Accepts]: Start accepts. Automaton has 47428 states and 152707 transitions. Word has length 25 [2019-12-18 13:27:02,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:27:02,784 INFO L462 AbstractCegarLoop]: Abstraction has 47428 states and 152707 transitions. [2019-12-18 13:27:02,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:27:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 47428 states and 152707 transitions. [2019-12-18 13:27:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:27:02,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:27:02,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:27:02,796 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:27:02,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:27:02,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1298639300, now seen corresponding path program 1 times [2019-12-18 13:27:02,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:27:02,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839140481] [2019-12-18 13:27:02,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:27:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:27:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:27:02,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839140481] [2019-12-18 13:27:02,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:27:02,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:27:02,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764697300] [2019-12-18 13:27:02,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:27:02,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:27:02,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:27:02,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:27:02,955 INFO L87 Difference]: Start difference. First operand 47428 states and 152707 transitions. Second operand 7 states. [2019-12-18 13:27:03,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:27:03,549 INFO L93 Difference]: Finished difference Result 62578 states and 198341 transitions. [2019-12-18 13:27:03,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:27:03,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-18 13:27:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:27:03,645 INFO L225 Difference]: With dead ends: 62578 [2019-12-18 13:27:03,646 INFO L226 Difference]: Without dead ends: 62578 [2019-12-18 13:27:03,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:27:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62578 states. [2019-12-18 13:27:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62578 to 49875. [2019-12-18 13:27:04,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49875 states. [2019-12-18 13:27:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49875 states to 49875 states and 160366 transitions. [2019-12-18 13:27:05,027 INFO L78 Accepts]: Start accepts. Automaton has 49875 states and 160366 transitions. Word has length 25 [2019-12-18 13:27:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:27:05,027 INFO L462 AbstractCegarLoop]: Abstraction has 49875 states and 160366 transitions. [2019-12-18 13:27:05,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:27:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 49875 states and 160366 transitions. [2019-12-18 13:27:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 13:27:05,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:27:05,043 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] [2019-12-18 13:27:05,043 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:27:05,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:27:05,044 INFO L82 PathProgramCache]: Analyzing trace with hash -511165584, now seen corresponding path program 1 times [2019-12-18 13:27:05,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:27:05,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369135748] [2019-12-18 13:27:05,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:27:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:27:05,119 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-18 13:27:05,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369135748] [2019-12-18 13:27:05,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:27:05,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:27:05,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192897299] [2019-12-18 13:27:05,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:27:05,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:27:05,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:27:05,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:27:05,121 INFO L87 Difference]: Start difference. First operand 49875 states and 160366 transitions. Second operand 5 states. [2019-12-18 13:27:05,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:27:05,193 INFO L93 Difference]: Finished difference Result 11001 states and 29928 transitions. [2019-12-18 13:27:05,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:27:05,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-18 13:27:05,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:27:05,207 INFO L225 Difference]: With dead ends: 11001 [2019-12-18 13:27:05,207 INFO L226 Difference]: Without dead ends: 9618 [2019-12-18 13:27:05,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:27:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9618 states. [2019-12-18 13:27:05,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9618 to 9408. [2019-12-18 13:27:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9408 states. [2019-12-18 13:27:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9408 states to 9408 states and 25322 transitions. [2019-12-18 13:27:05,410 INFO L78 Accepts]: Start accepts. Automaton has 9408 states and 25322 transitions. Word has length 31 [2019-12-18 13:27:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:27:05,411 INFO L462 AbstractCegarLoop]: Abstraction has 9408 states and 25322 transitions. [2019-12-18 13:27:05,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:27:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 9408 states and 25322 transitions. [2019-12-18 13:27:05,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 13:27:05,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:27:05,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:27:05,425 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:27:05,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:27:05,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1153167478, now seen corresponding path program 1 times [2019-12-18 13:27:05,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:27:05,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677718461] [2019-12-18 13:27:05,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:27:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:27:05,557 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-18 13:27:05,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677718461] [2019-12-18 13:27:05,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:27:05,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:27:05,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999451553] [2019-12-18 13:27:05,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:27:05,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:27:05,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:27:05,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:27:05,559 INFO L87 Difference]: Start difference. First operand 9408 states and 25322 transitions. Second operand 6 states. [2019-12-18 13:27:06,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:27:06,223 INFO L93 Difference]: Finished difference Result 10449 states and 27651 transitions. [2019-12-18 13:27:06,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:27:06,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-18 13:27:06,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:27:06,238 INFO L225 Difference]: With dead ends: 10449 [2019-12-18 13:27:06,239 INFO L226 Difference]: Without dead ends: 10449 [2019-12-18 13:27:06,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:27:06,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10449 states. [2019-12-18 13:27:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10449 to 8328. [2019-12-18 13:27:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8328 states. [2019-12-18 13:27:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8328 states to 8328 states and 22426 transitions. [2019-12-18 13:27:06,369 INFO L78 Accepts]: Start accepts. Automaton has 8328 states and 22426 transitions. Word has length 37 [2019-12-18 13:27:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:27:06,369 INFO L462 AbstractCegarLoop]: Abstraction has 8328 states and 22426 transitions. [2019-12-18 13:27:06,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:27:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 8328 states and 22426 transitions. [2019-12-18 13:27:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:27:06,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:27:06,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:27:06,381 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:27:06,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:27:06,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1087049671, now seen corresponding path program 1 times [2019-12-18 13:27:06,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:27:06,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650492465] [2019-12-18 13:27:06,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:27:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:27:06,440 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-18 13:27:06,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650492465] [2019-12-18 13:27:06,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:27:06,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:27:06,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869988066] [2019-12-18 13:27:06,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:27:06,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:27:06,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:27:06,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:27:06,443 INFO L87 Difference]: Start difference. First operand 8328 states and 22426 transitions. Second operand 3 states. [2019-12-18 13:27:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:27:06,529 INFO L93 Difference]: Finished difference Result 8867 states and 23518 transitions. [2019-12-18 13:27:06,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:27:06,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 13:27:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:27:06,542 INFO L225 Difference]: With dead ends: 8867 [2019-12-18 13:27:06,542 INFO L226 Difference]: Without dead ends: 8867 [2019-12-18 13:27:06,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:27:06,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8867 states. [2019-12-18 13:27:06,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8867 to 8434. [2019-12-18 13:27:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8434 states. [2019-12-18 13:27:06,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8434 states to 8434 states and 22652 transitions. [2019-12-18 13:27:06,662 INFO L78 Accepts]: Start accepts. Automaton has 8434 states and 22652 transitions. Word has length 51 [2019-12-18 13:27:06,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:27:06,662 INFO L462 AbstractCegarLoop]: Abstraction has 8434 states and 22652 transitions. [2019-12-18 13:27:06,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:27:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 8434 states and 22652 transitions. [2019-12-18 13:27:06,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 13:27:06,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:27:06,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:27:06,673 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:27:06,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:27:06,673 INFO L82 PathProgramCache]: Analyzing trace with hash 890965309, now seen corresponding path program 1 times [2019-12-18 13:27:06,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:27:06,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669869987] [2019-12-18 13:27:06,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:27:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:27:06,762 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-18 13:27:06,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669869987] [2019-12-18 13:27:06,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:27:06,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:27:06,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988703888] [2019-12-18 13:27:06,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:27:06,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:27:06,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:27:06,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:27:06,765 INFO L87 Difference]: Start difference. First operand 8434 states and 22652 transitions. Second operand 6 states. [2019-12-18 13:27:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:27:06,850 INFO L93 Difference]: Finished difference Result 5716 states and 16329 transitions. [2019-12-18 13:27:06,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:27:06,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-18 13:27:06,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:27:06,858 INFO L225 Difference]: With dead ends: 5716 [2019-12-18 13:27:06,858 INFO L226 Difference]: Without dead ends: 5634 [2019-12-18 13:27:06,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:27:06,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5634 states. [2019-12-18 13:27:06,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5634 to 5221. [2019-12-18 13:27:06,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5221 states. [2019-12-18 13:27:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5221 states to 5221 states and 15049 transitions. [2019-12-18 13:27:06,935 INFO L78 Accepts]: Start accepts. Automaton has 5221 states and 15049 transitions. Word has length 51 [2019-12-18 13:27:06,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:27:06,936 INFO L462 AbstractCegarLoop]: Abstraction has 5221 states and 15049 transitions. [2019-12-18 13:27:06,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:27:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 5221 states and 15049 transitions. [2019-12-18 13:27:06,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:27:06,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:27:06,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:27:06,945 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:27:06,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:27:06,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1332314804, now seen corresponding path program 1 times [2019-12-18 13:27:06,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:27:06,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653637056] [2019-12-18 13:27:06,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:27:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:27:07,037 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-18 13:27:07,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653637056] [2019-12-18 13:27:07,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:27:07,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:27:07,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486127358] [2019-12-18 13:27:07,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:27:07,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:27:07,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:27:07,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:27:07,040 INFO L87 Difference]: Start difference. First operand 5221 states and 15049 transitions. Second operand 3 states. [2019-12-18 13:27:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:27:07,068 INFO L93 Difference]: Finished difference Result 4935 states and 14016 transitions. [2019-12-18 13:27:07,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:27:07,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:27:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:27:07,075 INFO L225 Difference]: With dead ends: 4935 [2019-12-18 13:27:07,075 INFO L226 Difference]: Without dead ends: 4935 [2019-12-18 13:27:07,076 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-18 13:27:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4935 states. [2019-12-18 13:27:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4935 to 4935. [2019-12-18 13:27:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4935 states. [2019-12-18 13:27:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4935 states to 4935 states and 14016 transitions. [2019-12-18 13:27:07,162 INFO L78 Accepts]: Start accepts. Automaton has 4935 states and 14016 transitions. Word has length 65 [2019-12-18 13:27:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:27:07,162 INFO L462 AbstractCegarLoop]: Abstraction has 4935 states and 14016 transitions. [2019-12-18 13:27:07,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:27:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 4935 states and 14016 transitions. [2019-12-18 13:27:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:27:07,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:27:07,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:27:07,169 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:27:07,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:27:07,169 INFO L82 PathProgramCache]: Analyzing trace with hash 657704751, now seen corresponding path program 1 times [2019-12-18 13:27:07,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:27:07,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095013347] [2019-12-18 13:27:07,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:27:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:27:07,347 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-18 13:27:07,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095013347] [2019-12-18 13:27:07,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:27:07,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:27:07,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120782664] [2019-12-18 13:27:07,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:27:07,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:27:07,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:27:07,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:27:07,350 INFO L87 Difference]: Start difference. First operand 4935 states and 14016 transitions. Second operand 10 states. [2019-12-18 13:27:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:27:08,785 INFO L93 Difference]: Finished difference Result 7819 states and 21778 transitions. [2019-12-18 13:27:08,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 13:27:08,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 13:27:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:27:08,796 INFO L225 Difference]: With dead ends: 7819 [2019-12-18 13:27:08,796 INFO L226 Difference]: Without dead ends: 7819 [2019-12-18 13:27:08,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2019-12-18 13:27:08,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7819 states. [2019-12-18 13:27:08,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7819 to 6820. [2019-12-18 13:27:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6820 states. [2019-12-18 13:27:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6820 states to 6820 states and 19033 transitions. [2019-12-18 13:27:08,903 INFO L78 Accepts]: Start accepts. Automaton has 6820 states and 19033 transitions. Word has length 66 [2019-12-18 13:27:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:27:08,903 INFO L462 AbstractCegarLoop]: Abstraction has 6820 states and 19033 transitions. [2019-12-18 13:27:08,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:27:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 6820 states and 19033 transitions. [2019-12-18 13:27:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:27:08,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:27:08,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:27:08,913 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:27:08,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:27:08,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1650454547, now seen corresponding path program 2 times [2019-12-18 13:27:08,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:27:08,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451599790] [2019-12-18 13:27:08,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:27:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:27:09,019 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-18 13:27:09,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451599790] [2019-12-18 13:27:09,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:27:09,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:27:09,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104604074] [2019-12-18 13:27:09,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:27:09,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:27:09,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:27:09,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:27:09,021 INFO L87 Difference]: Start difference. First operand 6820 states and 19033 transitions. Second operand 6 states. [2019-12-18 13:27:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:27:09,522 INFO L93 Difference]: Finished difference Result 9409 states and 26166 transitions. [2019-12-18 13:27:09,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:27:09,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 13:27:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:27:09,535 INFO L225 Difference]: With dead ends: 9409 [2019-12-18 13:27:09,535 INFO L226 Difference]: Without dead ends: 9409 [2019-12-18 13:27:09,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:27:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9409 states. [2019-12-18 13:27:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9409 to 7684. [2019-12-18 13:27:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7684 states. [2019-12-18 13:27:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 21520 transitions. [2019-12-18 13:27:09,651 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 21520 transitions. Word has length 66 [2019-12-18 13:27:09,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:27:09,651 INFO L462 AbstractCegarLoop]: Abstraction has 7684 states and 21520 transitions. [2019-12-18 13:27:09,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:27:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 21520 transitions. [2019-12-18 13:27:09,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:27:09,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:27:09,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:27:09,660 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:27:09,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:27:09,661 INFO L82 PathProgramCache]: Analyzing trace with hash 858764483, now seen corresponding path program 3 times [2019-12-18 13:27:09,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:27:09,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702011116] [2019-12-18 13:27:09,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:27:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:27:09,738 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-18 13:27:09,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702011116] [2019-12-18 13:27:09,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:27:09,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:27:09,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368884974] [2019-12-18 13:27:09,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:27:09,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:27:09,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:27:09,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:27:09,740 INFO L87 Difference]: Start difference. First operand 7684 states and 21520 transitions. Second operand 3 states. [2019-12-18 13:27:09,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:27:09,799 INFO L93 Difference]: Finished difference Result 7683 states and 21518 transitions. [2019-12-18 13:27:09,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:27:09,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:27:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:27:09,809 INFO L225 Difference]: With dead ends: 7683 [2019-12-18 13:27:09,809 INFO L226 Difference]: Without dead ends: 7683 [2019-12-18 13:27:09,809 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-18 13:27:09,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7683 states. [2019-12-18 13:27:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7683 to 5466. [2019-12-18 13:27:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-12-18 13:27:09,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 15411 transitions. [2019-12-18 13:27:09,897 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 15411 transitions. Word has length 66 [2019-12-18 13:27:09,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:27:09,897 INFO L462 AbstractCegarLoop]: Abstraction has 5466 states and 15411 transitions. [2019-12-18 13:27:09,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:27:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 15411 transitions. [2019-12-18 13:27:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:27:09,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:27:09,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:27:09,904 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:27:09,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:27:09,905 INFO L82 PathProgramCache]: Analyzing trace with hash 445823329, now seen corresponding path program 1 times [2019-12-18 13:27:09,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:27:09,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358850543] [2019-12-18 13:27:09,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:27:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:27:10,048 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-18 13:27:10,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358850543] [2019-12-18 13:27:10,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:27:10,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:27:10,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014643255] [2019-12-18 13:27:10,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:27:10,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:27:10,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:27:10,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:27:10,050 INFO L87 Difference]: Start difference. First operand 5466 states and 15411 transitions. Second operand 7 states. [2019-12-18 13:27:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:27:10,207 INFO L93 Difference]: Finished difference Result 10772 states and 30549 transitions. [2019-12-18 13:27:10,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:27:10,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-18 13:27:10,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:27:10,215 INFO L225 Difference]: With dead ends: 10772 [2019-12-18 13:27:10,216 INFO L226 Difference]: Without dead ends: 5570 [2019-12-18 13:27:10,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:27:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states. [2019-12-18 13:27:10,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 4533. [2019-12-18 13:27:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4533 states. [2019-12-18 13:27:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4533 states to 4533 states and 12720 transitions. [2019-12-18 13:27:10,293 INFO L78 Accepts]: Start accepts. Automaton has 4533 states and 12720 transitions. Word has length 67 [2019-12-18 13:27:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:27:10,294 INFO L462 AbstractCegarLoop]: Abstraction has 4533 states and 12720 transitions. [2019-12-18 13:27:10,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:27:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4533 states and 12720 transitions. [2019-12-18 13:27:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:27:10,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:27:10,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:27:10,298 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:27:10,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:27:10,299 INFO L82 PathProgramCache]: Analyzing trace with hash -315435435, now seen corresponding path program 2 times [2019-12-18 13:27:10,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:27:10,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523559079] [2019-12-18 13:27:10,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:27:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:27:10,486 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-18 13:27:10,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523559079] [2019-12-18 13:27:10,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:27:10,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:27:10,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206286397] [2019-12-18 13:27:10,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:27:10,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:27:10,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:27:10,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:27:10,493 INFO L87 Difference]: Start difference. First operand 4533 states and 12720 transitions. Second operand 12 states. [2019-12-18 13:27:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:27:11,173 INFO L93 Difference]: Finished difference Result 8552 states and 24042 transitions. [2019-12-18 13:27:11,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 13:27:11,173 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 13:27:11,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:27:11,190 INFO L225 Difference]: With dead ends: 8552 [2019-12-18 13:27:11,190 INFO L226 Difference]: Without dead ends: 8041 [2019-12-18 13:27:11,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-12-18 13:27:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8041 states. [2019-12-18 13:27:11,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8041 to 5569. [2019-12-18 13:27:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5569 states. [2019-12-18 13:27:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 15505 transitions. [2019-12-18 13:27:11,341 INFO L78 Accepts]: Start accepts. Automaton has 5569 states and 15505 transitions. Word has length 67 [2019-12-18 13:27:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:27:11,341 INFO L462 AbstractCegarLoop]: Abstraction has 5569 states and 15505 transitions. [2019-12-18 13:27:11,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:27:11,341 INFO L276 IsEmpty]: Start isEmpty. Operand 5569 states and 15505 transitions. [2019-12-18 13:27:11,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:27:11,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:27:11,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:27:11,349 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:27:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:27:11,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1193254667, now seen corresponding path program 3 times [2019-12-18 13:27:11,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:27:11,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63241462] [2019-12-18 13:27:11,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:27:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:27:11,429 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-18 13:27:11,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63241462] [2019-12-18 13:27:11,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:27:11,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:27:11,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308611116] [2019-12-18 13:27:11,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:27:11,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:27:11,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:27:11,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:27:11,432 INFO L87 Difference]: Start difference. First operand 5569 states and 15505 transitions. Second operand 3 states. [2019-12-18 13:27:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:27:11,459 INFO L93 Difference]: Finished difference Result 5221 states and 14326 transitions. [2019-12-18 13:27:11,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:27:11,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 13:27:11,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:27:11,466 INFO L225 Difference]: With dead ends: 5221 [2019-12-18 13:27:11,467 INFO L226 Difference]: Without dead ends: 5221 [2019-12-18 13:27:11,467 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-18 13:27:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5221 states. [2019-12-18 13:27:11,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5221 to 5083. [2019-12-18 13:27:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5083 states. [2019-12-18 13:27:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5083 states to 5083 states and 13946 transitions. [2019-12-18 13:27:11,580 INFO L78 Accepts]: Start accepts. Automaton has 5083 states and 13946 transitions. Word has length 67 [2019-12-18 13:27:11,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:27:11,581 INFO L462 AbstractCegarLoop]: Abstraction has 5083 states and 13946 transitions. [2019-12-18 13:27:11,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:27:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 5083 states and 13946 transitions. [2019-12-18 13:27:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 13:27:11,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:27:11,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:27:11,588 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:27:11,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:27:11,589 INFO L82 PathProgramCache]: Analyzing trace with hash 839287492, now seen corresponding path program 1 times [2019-12-18 13:27:11,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:27:11,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707021734] [2019-12-18 13:27:11,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:27:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:27:11,997 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-18 13:27:11,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707021734] [2019-12-18 13:27:11,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:27:11,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:27:11,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007257187] [2019-12-18 13:27:11,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:27:11,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:27:11,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:27:11,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:27:11,999 INFO L87 Difference]: Start difference. First operand 5083 states and 13946 transitions. Second operand 13 states. [2019-12-18 13:27:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:27:12,820 INFO L93 Difference]: Finished difference Result 8130 states and 22193 transitions. [2019-12-18 13:27:12,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 13:27:12,821 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 13:27:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:27:12,831 INFO L225 Difference]: With dead ends: 8130 [2019-12-18 13:27:12,831 INFO L226 Difference]: Without dead ends: 7367 [2019-12-18 13:27:12,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 13:27:12,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7367 states. [2019-12-18 13:27:12,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7367 to 5459. [2019-12-18 13:27:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5459 states. [2019-12-18 13:27:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5459 states to 5459 states and 14951 transitions. [2019-12-18 13:27:12,995 INFO L78 Accepts]: Start accepts. Automaton has 5459 states and 14951 transitions. Word has length 68 [2019-12-18 13:27:12,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:27:12,996 INFO L462 AbstractCegarLoop]: Abstraction has 5459 states and 14951 transitions. [2019-12-18 13:27:12,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:27:12,996 INFO L276 IsEmpty]: Start isEmpty. Operand 5459 states and 14951 transitions. [2019-12-18 13:27:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 13:27:13,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:27:13,006 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:27:13,006 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:27:13,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:27:13,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1214731398, now seen corresponding path program 2 times [2019-12-18 13:27:13,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:27:13,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699531634] [2019-12-18 13:27:13,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:27:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:27:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:27:13,182 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:27:13,182 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:27:13,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] ULTIMATE.startENTRY-->L817: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~x~0_167) (= v_~x$r_buff0_thd1~0_194 0) (= v_~x$r_buff1_thd0~0_280 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1019~0.base_25|) 0) (= |v_#NULL.offset_6| 0) (= v_~x$r_buff0_thd0~0_376 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1019~0.base_25| 4)) (= v_~a~0_13 0) (= v_~main$tmp_guard0~0_27 0) (< 0 |v_#StackHeapBarrier_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1019~0.base_25| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1019~0.base_25|) |v_ULTIMATE.start_main_~#t1019~0.offset_19| 0)) |v_#memory_int_15|) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1019~0.base_25| 1)) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1019~0.base_25|) (= 0 v_~x$r_buff0_thd2~0_295) (= 0 v_~x$w_buff0_used~0_668) (= 0 v_~x$r_buff1_thd2~0_179) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1~0_150) (= 0 v_~x$w_buff0~0_169) (= v_~y~0_123 0) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~x$r_buff0_thd3~0_178) (= v_~__unbuffered_cnt~0_130 0) (= 0 |v_ULTIMATE.start_main_~#t1019~0.offset_19|) (= 0 v_~z~0_9) (= v_~x$r_buff1_thd1~0_197 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~weak$$choice2~0_115 0) (= v_~x$mem_tmp~0_37 0) (= v_~__unbuffered_p2_EBX~0_19 0) (= v_~__unbuffered_p1_EAX~0_129 0) (= v_~x$flush_delayed~0_54 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p2_EAX~0_19) (= 0 v_~x$r_buff1_thd3~0_174) (= 0 v_~x$w_buff1_used~0_384))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ~x$w_buff0~0=v_~x$w_buff0~0_169, ULTIMATE.start_main_~#t1020~0.base=|v_ULTIMATE.start_main_~#t1020~0.base_27|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_37|, ~x$flush_delayed~0=v_~x$flush_delayed~0_54, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_37|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_35|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_197, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_178, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_~#t1020~0.offset=|v_ULTIMATE.start_main_~#t1020~0.offset_20|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ~a~0=v_~a~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_129, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_376, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_59|, ~x$w_buff1~0=v_~x$w_buff1~0_150, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_56|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_384, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_179, ULTIMATE.start_main_~#t1021~0.base=|v_ULTIMATE.start_main_~#t1021~0.base_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_27|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130, ~x~0=v_~x~0_167, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_194, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_75|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_30|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_163|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_19|, ~x$mem_tmp~0=v_~x$mem_tmp~0_37, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_9|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_16|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_~#t1019~0.base=|v_ULTIMATE.start_main_~#t1019~0.base_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_64|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_280, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_295, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_56|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_668, ULTIMATE.start_main_~#t1021~0.offset=|v_ULTIMATE.start_main_~#t1021~0.offset_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_115, ULTIMATE.start_main_~#t1019~0.offset=|v_ULTIMATE.start_main_~#t1019~0.offset_19|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_~#t1020~0.base, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1020~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1021~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1019~0.base, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1021~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1019~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 13:27:13,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L817-1-->L819: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1020~0.base_13| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1020~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1020~0.base_13|) |v_ULTIMATE.start_main_~#t1020~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1020~0.base_13| 4)) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1020~0.base_13| 1) |v_#valid_38|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1020~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1020~0.offset_11| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1020~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|, ULTIMATE.start_main_~#t1020~0.base=|v_ULTIMATE.start_main_~#t1020~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1020~0.offset=|v_ULTIMATE.start_main_~#t1020~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1020~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1020~0.offset] because there is no mapped edge [2019-12-18 13:27:13,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L4-->L768: Formula: (and (= ~x$r_buff1_thd2~0_Out1053568514 ~x$r_buff0_thd2~0_In1053568514) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1053568514)) (= ~x$r_buff0_thd3~0_In1053568514 ~x$r_buff1_thd3~0_Out1053568514) (= ~y~0_In1053568514 ~__unbuffered_p1_EAX~0_Out1053568514) (= ~x$r_buff1_thd0~0_Out1053568514 ~x$r_buff0_thd0~0_In1053568514) (= 1 ~x$r_buff0_thd2~0_Out1053568514) (= ~x$r_buff0_thd1~0_In1053568514 ~x$r_buff1_thd1~0_Out1053568514)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1053568514, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1053568514, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1053568514, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1053568514, ~y~0=~y~0_In1053568514, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1053568514} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1053568514, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1053568514, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1053568514, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1053568514, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out1053568514, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1053568514, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1053568514, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1053568514, ~y~0=~y~0_In1053568514, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1053568514, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1053568514} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 13:27:13,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1168368098 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1168368098 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1168368098| ~x$w_buff0_used~0_In-1168368098)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1168368098|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1168368098, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1168368098} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1168368098|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1168368098, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1168368098} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 13:27:13,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In-1054789949 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1054789949 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1054789949 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1054789949 256)))) (or (and (= ~x$w_buff1_used~0_In-1054789949 |P1Thread1of1ForFork1_#t~ite12_Out-1054789949|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1054789949|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1054789949, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1054789949, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1054789949, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1054789949} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1054789949, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1054789949, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1054789949|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1054789949, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1054789949} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:27:13,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L771-->L772: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1730520270 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1730520270 256)))) (or (and (= ~x$r_buff0_thd2~0_In-1730520270 ~x$r_buff0_thd2~0_Out-1730520270) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-1730520270)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1730520270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1730520270} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1730520270|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1730520270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1730520270} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 13:27:13,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-315494052 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-315494052 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-315494052 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-315494052 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out-315494052| ~x$r_buff1_thd2~0_In-315494052)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-315494052| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-315494052, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-315494052, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-315494052, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-315494052} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-315494052, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-315494052, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-315494052, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-315494052|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-315494052} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:27:13,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L772-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_127 |v_P1Thread1of1ForFork1_#t~ite14_40|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_39|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:27:13,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L819-1-->L821: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1021~0.base_12| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1021~0.base_12|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1021~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1021~0.base_12|) |v_ULTIMATE.start_main_~#t1021~0.offset_11| 2))) (not (= |v_ULTIMATE.start_main_~#t1021~0.base_12| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1021~0.base_12| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1021~0.base_12|) (= |v_ULTIMATE.start_main_~#t1021~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1021~0.offset=|v_ULTIMATE.start_main_~#t1021~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_6|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1021~0.base=|v_ULTIMATE.start_main_~#t1021~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1021~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1021~0.base, #length] because there is no mapped edge [2019-12-18 13:27:13,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L794-2-->L794-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-901281593 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-901281593 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-901281593| ~x$w_buff1~0_In-901281593)) (and (or .cse1 .cse0) (= ~x~0_In-901281593 |P2Thread1of1ForFork2_#t~ite15_Out-901281593|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-901281593, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-901281593, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-901281593, ~x~0=~x~0_In-901281593} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-901281593|, ~x$w_buff1~0=~x$w_buff1~0_In-901281593, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-901281593, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-901281593, ~x~0=~x~0_In-901281593} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 13:27:13,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L794-4-->L795: Formula: (= v_~x~0_23 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_9|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 13:27:13,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L739-2-->L739-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1755874739 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1755874739 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-1755874739| ~x~0_In-1755874739)) (and (= ~x$w_buff1~0_In-1755874739 |P0Thread1of1ForFork0_#t~ite3_Out-1755874739|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1755874739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1755874739, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1755874739, ~x~0=~x~0_In-1755874739} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1755874739|, ~x$w_buff1~0=~x$w_buff1~0_In-1755874739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1755874739, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1755874739, ~x~0=~x~0_In-1755874739} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-18 13:27:13,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L739-4-->L740: Formula: (= v_~x~0_30 |v_P0Thread1of1ForFork0_#t~ite3_10|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_10|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_9|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_13|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-18 13:27:13,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1404982202 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1404982202 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out1404982202|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1404982202 |P2Thread1of1ForFork2_#t~ite17_Out1404982202|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1404982202, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1404982202} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1404982202, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1404982202|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1404982202} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 13:27:13,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1045167456 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1045167456 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-1045167456 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1045167456 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1045167456 |P2Thread1of1ForFork2_#t~ite18_Out-1045167456|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out-1045167456| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1045167456, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1045167456, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1045167456, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1045167456} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1045167456, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1045167456, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1045167456, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1045167456|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1045167456} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 13:27:13,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2039518391 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In2039518391 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out2039518391|) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out2039518391| ~x$r_buff0_thd3~0_In2039518391)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2039518391, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2039518391} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2039518391, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out2039518391|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2039518391} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 13:27:13,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1686126658 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1686126658 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-1686126658 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-1686126658 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1686126658| ~x$r_buff1_thd3~0_In-1686126658) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-1686126658|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1686126658, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1686126658, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1686126658, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1686126658} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1686126658|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1686126658, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1686126658, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1686126658, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1686126658} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 13:27:13,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L798-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_38| v_~x$r_buff1_thd3~0_122)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_37|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_122, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 13:27:13,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1430033576 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1430033576 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1430033576| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1430033576| ~x$w_buff0_used~0_In1430033576)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1430033576, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1430033576} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1430033576|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1430033576, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1430033576} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:27:13,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-551048638 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-551048638 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-551048638 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-551048638 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-551048638| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out-551048638| ~x$w_buff1_used~0_In-551048638) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-551048638, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-551048638, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-551048638, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-551048638} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-551048638|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-551048638, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-551048638, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-551048638, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-551048638} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:27:13,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-978946255 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-978946255 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out-978946255| ~x$r_buff0_thd1~0_In-978946255) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-978946255| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-978946255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-978946255} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-978946255, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-978946255|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-978946255} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 13:27:13,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1605079927 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1605079927 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1605079927 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1605079927 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1605079927| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1605079927| ~x$r_buff1_thd1~0_In1605079927) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1605079927, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1605079927, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1605079927, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1605079927} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1605079927, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1605079927|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1605079927, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1605079927, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1605079927} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:27:13,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_83} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 13:27:13,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L825-->L827-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_107 256) 0) (= (mod v_~x$r_buff0_thd0~0_52 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:27:13,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L827-2-->L827-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1735551610 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1735551610 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite24_Out1735551610| ~x$w_buff1~0_In1735551610)) (and (= |ULTIMATE.start_main_#t~ite24_Out1735551610| ~x~0_In1735551610) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1735551610, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1735551610, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1735551610, ~x~0=~x~0_In1735551610} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1735551610, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1735551610|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1735551610, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1735551610, ~x~0=~x~0_In1735551610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 13:27:13,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-4-->L828: Formula: (= v_~x~0_53 |v_ULTIMATE.start_main_#t~ite24_8|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_7|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_8|, ~x~0=v_~x~0_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~x~0] because there is no mapped edge [2019-12-18 13:27:13,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1737333583 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1737333583 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1737333583 |ULTIMATE.start_main_#t~ite26_Out-1737333583|)) (and (= 0 |ULTIMATE.start_main_#t~ite26_Out-1737333583|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1737333583, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1737333583} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1737333583, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1737333583|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1737333583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 13:27:13,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L829-->L829-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-552607168 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-552607168 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-552607168 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-552607168 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out-552607168| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-552607168 |ULTIMATE.start_main_#t~ite27_Out-552607168|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-552607168, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-552607168, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-552607168, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-552607168} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-552607168, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-552607168, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-552607168|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-552607168, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-552607168} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 13:27:13,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1746950838 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1746950838 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out-1746950838|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In-1746950838 |ULTIMATE.start_main_#t~ite28_Out-1746950838|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1746950838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1746950838} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1746950838, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1746950838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1746950838} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 13:27:13,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-349099330 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-349099330 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-349099330 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-349099330 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite29_Out-349099330|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In-349099330 |ULTIMATE.start_main_#t~ite29_Out-349099330|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-349099330, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-349099330, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-349099330, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-349099330} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-349099330, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-349099330|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-349099330, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-349099330, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-349099330} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 13:27:13,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L843-->L844: Formula: (and (= v_~x$r_buff0_thd0~0_95 v_~x$r_buff0_thd0~0_94) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_9|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:27:13,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L844-->L844-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2143037505 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In2143037505 256) 0))) (or (and .cse0 (= (mod ~x$r_buff1_thd0~0_In2143037505 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In2143037505 256)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In2143037505 256))))) (= ~x$r_buff1_thd0~0_In2143037505 |ULTIMATE.start_main_#t~ite50_Out2143037505|) (= |ULTIMATE.start_main_#t~ite51_Out2143037505| |ULTIMATE.start_main_#t~ite50_Out2143037505|) .cse1) (and (= |ULTIMATE.start_main_#t~ite50_In2143037505| |ULTIMATE.start_main_#t~ite50_Out2143037505|) (= |ULTIMATE.start_main_#t~ite51_Out2143037505| ~x$r_buff1_thd0~0_In2143037505) (not .cse1)))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In2143037505|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2143037505, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2143037505, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2143037505, ~weak$$choice2~0=~weak$$choice2~0_In2143037505, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2143037505} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2143037505|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2143037505, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2143037505|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2143037505, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2143037505, ~weak$$choice2~0=~weak$$choice2~0_In2143037505, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2143037505} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:27:13,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L846-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_11 256)) (= v_~x$mem_tmp~0_32 v_~x~0_141) (not (= 0 (mod v_~x$flush_delayed~0_43 256))) (= v_~x$flush_delayed~0_42 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_32} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_32, ~x~0=v_~x~0_141, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:27:13,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 13:27:13,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:27:13 BasicIcfg [2019-12-18 13:27:13,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:27:13,321 INFO L168 Benchmark]: Toolchain (without parser) took 121849.54 ms. Allocated memory was 139.5 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 13:27:13,322 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 139.5 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:27:13,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.14 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 100.4 MB in the beginning and 156.0 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:27:13,323 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.47 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:27:13,324 INFO L168 Benchmark]: Boogie Preprocessor took 42.37 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:27:13,325 INFO L168 Benchmark]: RCFGBuilder took 841.74 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 100.2 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:27:13,325 INFO L168 Benchmark]: TraceAbstraction took 120040.54 ms. Allocated memory was 202.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.6 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 13:27:13,329 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.58 ms. Allocated memory is still 139.5 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 824.14 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 100.4 MB in the beginning and 156.0 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.47 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.37 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 841.74 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 100.2 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 120040.54 ms. Allocated memory was 202.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.6 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 177 ProgramPointsBefore, 98 ProgramPointsAfterwards, 214 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 30 ChoiceCompositions, 5956 VarBasedMoverChecksPositive, 212 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 83692 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L817] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L819] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 2 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L821] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L794] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 a = 1 [L736] 1 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L739] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L795] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L796] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L797] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L740] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L829] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L830] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L831] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 x$flush_delayed = weak$$choice2 [L837] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L839] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L840] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L841] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L841] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 119.7s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4085 SDtfs, 4254 SDslu, 9994 SDs, 0 SdLazy, 5096 SolverSat, 285 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 31 SyntacticMatches, 22 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223048occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 63.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 120979 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 812 ConstructedInterpolants, 0 QuantifiedInterpolants, 210604 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...