/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:12:10,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:12:10,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:12:10,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:12:10,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:12:10,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:12:10,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:12:10,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:12:10,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:12:10,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:12:10,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:12:10,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:12:10,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:12:10,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:12:10,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:12:10,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:12:10,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:12:10,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:12:10,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:12:10,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:12:10,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:12:10,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:12:10,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:12:10,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:12:10,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:12:10,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:12:10,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:12:10,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:12:10,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:12:10,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:12:10,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:12:10,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:12:10,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:12:10,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:12:10,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:12:10,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:12:10,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:12:10,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:12:10,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:12:10,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:12:10,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:12:10,261 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:12:10,278 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:12:10,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:12:10,280 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:12:10,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:12:10,281 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:12:10,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:12:10,281 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:12:10,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:12:10,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:12:10,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:12:10,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:12:10,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:12:10,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:12:10,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:12:10,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:12:10,284 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:12:10,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:12:10,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:12:10,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:12:10,285 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:12:10,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:12:10,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:12:10,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:12:10,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:12:10,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:12:10,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:12:10,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:12:10,286 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:12:10,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:12:10,287 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:12:10,288 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:12:10,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:12:10,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:12:10,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:12:10,586 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:12:10,587 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:12:10,588 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2019-12-27 18:12:10,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f152ccbb4/3155d64ffc85409a853b544dbde761b3/FLAG8e4fad92e [2019-12-27 18:12:11,264 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:12:11,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2019-12-27 18:12:11,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f152ccbb4/3155d64ffc85409a853b544dbde761b3/FLAG8e4fad92e [2019-12-27 18:12:11,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f152ccbb4/3155d64ffc85409a853b544dbde761b3 [2019-12-27 18:12:11,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:12:11,536 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:12:11,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:12:11,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:12:11,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:12:11,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:12:11" (1/1) ... [2019-12-27 18:12:11,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a6e624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:11, skipping insertion in model container [2019-12-27 18:12:11,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:12:11" (1/1) ... [2019-12-27 18:12:11,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:12:11,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:12:12,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:12:12,159 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:12:12,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:12:12,325 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:12:12,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:12 WrapperNode [2019-12-27 18:12:12,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:12:12,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:12:12,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:12:12,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:12:12,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:12" (1/1) ... [2019-12-27 18:12:12,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:12" (1/1) ... [2019-12-27 18:12:12,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:12:12,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:12:12,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:12:12,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:12:12,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:12" (1/1) ... [2019-12-27 18:12:12,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:12" (1/1) ... [2019-12-27 18:12:12,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:12" (1/1) ... [2019-12-27 18:12:12,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:12" (1/1) ... [2019-12-27 18:12:12,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:12" (1/1) ... [2019-12-27 18:12:12,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:12" (1/1) ... [2019-12-27 18:12:12,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:12" (1/1) ... [2019-12-27 18:12:12,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:12:12,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:12:12,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:12:12,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:12:12,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12: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-27 18:12:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:12:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:12:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:12:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:12:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:12:12,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:12:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:12:12,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:12:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:12:12,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:12:12,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:12:12,498 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:12:13,232 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:12:13,232 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:12:13,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:12:13 BoogieIcfgContainer [2019-12-27 18:12:13,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:12:13,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:12:13,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:12:13,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:12:13,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:12:11" (1/3) ... [2019-12-27 18:12:13,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4685d5aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:12:13, skipping insertion in model container [2019-12-27 18:12:13,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:12" (2/3) ... [2019-12-27 18:12:13,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4685d5aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:12:13, skipping insertion in model container [2019-12-27 18:12:13,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:12:13" (3/3) ... [2019-12-27 18:12:13,242 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_power.opt.i [2019-12-27 18:12:13,255 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:12:13,256 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:12:13,264 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:12:13,265 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:12:13,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,301 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,301 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,309 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,310 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,322 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,323 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,323 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,328 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,329 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:13,346 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 18:12:13,365 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:12:13,366 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:12:13,366 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:12:13,366 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:12:13,366 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:12:13,366 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:12:13,367 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:12:13,367 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:12:13,384 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 18:12:13,386 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 18:12:13,488 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 18:12:13,488 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:12:13,503 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:12:13,521 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 18:12:13,583 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 18:12:13,583 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:12:13,592 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:12:13,608 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 18:12:13,609 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:12:18,611 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 18:12:18,738 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46090 [2019-12-27 18:12:18,738 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 18:12:18,742 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 91 transitions [2019-12-27 18:12:19,233 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8654 states. [2019-12-27 18:12:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states. [2019-12-27 18:12:19,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:12:19,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:19,244 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:12:19,244 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:19,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:19,251 INFO L82 PathProgramCache]: Analyzing trace with hash 722891, now seen corresponding path program 1 times [2019-12-27 18:12:19,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:19,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278304504] [2019-12-27 18:12:19,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:19,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278304504] [2019-12-27 18:12:19,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:19,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:12:19,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [862386066] [2019-12-27 18:12:19,492 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:19,497 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:19,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:12:19,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:19,510 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:19,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:12:19,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:19,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:12:19,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:12:19,525 INFO L87 Difference]: Start difference. First operand 8654 states. Second operand 3 states. [2019-12-27 18:12:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:19,817 INFO L93 Difference]: Finished difference Result 8604 states and 28108 transitions. [2019-12-27 18:12:19,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:12:19,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:12:19,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:19,974 INFO L225 Difference]: With dead ends: 8604 [2019-12-27 18:12:19,974 INFO L226 Difference]: Without dead ends: 8436 [2019-12-27 18:12:19,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:12:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8436 states. [2019-12-27 18:12:20,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8436 to 8436. [2019-12-27 18:12:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8436 states. [2019-12-27 18:12:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 27590 transitions. [2019-12-27 18:12:20,574 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 27590 transitions. Word has length 3 [2019-12-27 18:12:20,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:20,575 INFO L462 AbstractCegarLoop]: Abstraction has 8436 states and 27590 transitions. [2019-12-27 18:12:20,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:12:20,575 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 27590 transitions. [2019-12-27 18:12:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:12:20,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:20,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:20,578 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:20,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:20,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1596153002, now seen corresponding path program 1 times [2019-12-27 18:12:20,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:20,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396903769] [2019-12-27 18:12:20,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:20,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396903769] [2019-12-27 18:12:20,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:20,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:12:20,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [583146082] [2019-12-27 18:12:20,690 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:20,693 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:20,698 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:12:20,699 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:20,701 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:20,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:12:20,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:20,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:12:20,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:12:20,704 INFO L87 Difference]: Start difference. First operand 8436 states and 27590 transitions. Second operand 4 states. [2019-12-27 18:12:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:21,183 INFO L93 Difference]: Finished difference Result 13130 states and 41153 transitions. [2019-12-27 18:12:21,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:12:21,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:12:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:21,259 INFO L225 Difference]: With dead ends: 13130 [2019-12-27 18:12:21,259 INFO L226 Difference]: Without dead ends: 13123 [2019-12-27 18:12:21,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2019-12-27 18:12:22,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 11988. [2019-12-27 18:12:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11988 states. [2019-12-27 18:12:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11988 states to 11988 states and 38075 transitions. [2019-12-27 18:12:22,368 INFO L78 Accepts]: Start accepts. Automaton has 11988 states and 38075 transitions. Word has length 11 [2019-12-27 18:12:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:22,369 INFO L462 AbstractCegarLoop]: Abstraction has 11988 states and 38075 transitions. [2019-12-27 18:12:22,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:12:22,369 INFO L276 IsEmpty]: Start isEmpty. Operand 11988 states and 38075 transitions. [2019-12-27 18:12:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:12:22,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:22,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:22,373 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:22,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1194917716, now seen corresponding path program 1 times [2019-12-27 18:12:22,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:22,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179064728] [2019-12-27 18:12:22,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:22,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:22,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179064728] [2019-12-27 18:12:22,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:22,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:12:22,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1003839023] [2019-12-27 18:12:22,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:22,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:22,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:12:22,448 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:22,448 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:22,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:12:22,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:22,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:12:22,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:12:22,450 INFO L87 Difference]: Start difference. First operand 11988 states and 38075 transitions. Second operand 4 states. [2019-12-27 18:12:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:22,748 INFO L93 Difference]: Finished difference Result 14736 states and 46267 transitions. [2019-12-27 18:12:22,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:12:22,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:12:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:22,805 INFO L225 Difference]: With dead ends: 14736 [2019-12-27 18:12:22,805 INFO L226 Difference]: Without dead ends: 14736 [2019-12-27 18:12:22,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14736 states. [2019-12-27 18:12:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14736 to 13160. [2019-12-27 18:12:23,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13160 states. [2019-12-27 18:12:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 41689 transitions. [2019-12-27 18:12:23,399 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 41689 transitions. Word has length 11 [2019-12-27 18:12:23,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:23,400 INFO L462 AbstractCegarLoop]: Abstraction has 13160 states and 41689 transitions. [2019-12-27 18:12:23,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:12:23,400 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 41689 transitions. [2019-12-27 18:12:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:12:23,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:23,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:23,405 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:23,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1502155024, now seen corresponding path program 1 times [2019-12-27 18:12:23,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:23,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417493023] [2019-12-27 18:12:23,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:23,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417493023] [2019-12-27 18:12:23,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:23,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:12:23,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [808469522] [2019-12-27 18:12:23,540 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:23,542 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:23,546 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 39 transitions. [2019-12-27 18:12:23,546 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:23,548 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:23,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:12:23,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:23,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:12:23,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:23,550 INFO L87 Difference]: Start difference. First operand 13160 states and 41689 transitions. Second operand 5 states. [2019-12-27 18:12:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:24,012 INFO L93 Difference]: Finished difference Result 17572 states and 54523 transitions. [2019-12-27 18:12:24,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:12:24,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 18:12:24,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:24,074 INFO L225 Difference]: With dead ends: 17572 [2019-12-27 18:12:24,075 INFO L226 Difference]: Without dead ends: 17565 [2019-12-27 18:12:24,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:12:24,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17565 states. [2019-12-27 18:12:24,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17565 to 13105. [2019-12-27 18:12:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13105 states. [2019-12-27 18:12:24,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13105 states to 13105 states and 41426 transitions. [2019-12-27 18:12:24,655 INFO L78 Accepts]: Start accepts. Automaton has 13105 states and 41426 transitions. Word has length 17 [2019-12-27 18:12:24,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:24,656 INFO L462 AbstractCegarLoop]: Abstraction has 13105 states and 41426 transitions. [2019-12-27 18:12:24,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:12:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 13105 states and 41426 transitions. [2019-12-27 18:12:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:12:24,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:24,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:24,670 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:24,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:24,671 INFO L82 PathProgramCache]: Analyzing trace with hash 933350131, now seen corresponding path program 1 times [2019-12-27 18:12:24,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:24,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669531172] [2019-12-27 18:12:24,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:24,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669531172] [2019-12-27 18:12:24,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:24,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:12:24,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [770293195] [2019-12-27 18:12:24,752 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:24,756 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:24,761 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:12:24,761 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:24,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:24,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:12:24,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:24,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:12:24,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:12:24,763 INFO L87 Difference]: Start difference. First operand 13105 states and 41426 transitions. Second operand 3 states. [2019-12-27 18:12:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:24,879 INFO L93 Difference]: Finished difference Result 16057 states and 50095 transitions. [2019-12-27 18:12:24,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:12:24,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 18:12:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:24,938 INFO L225 Difference]: With dead ends: 16057 [2019-12-27 18:12:24,938 INFO L226 Difference]: Without dead ends: 16057 [2019-12-27 18:12:24,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:12:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16057 states. [2019-12-27 18:12:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16057 to 14186. [2019-12-27 18:12:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14186 states. [2019-12-27 18:12:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 44710 transitions. [2019-12-27 18:12:25,347 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 44710 transitions. Word has length 25 [2019-12-27 18:12:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:25,348 INFO L462 AbstractCegarLoop]: Abstraction has 14186 states and 44710 transitions. [2019-12-27 18:12:25,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:12:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 44710 transitions. [2019-12-27 18:12:25,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:12:25,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:25,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:25,362 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:25,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:25,362 INFO L82 PathProgramCache]: Analyzing trace with hash 933194542, now seen corresponding path program 1 times [2019-12-27 18:12:25,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:25,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004340884] [2019-12-27 18:12:25,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:25,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-27 18:12:25,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004340884] [2019-12-27 18:12:25,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:25,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:12:25,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1064711729] [2019-12-27 18:12:25,441 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:25,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:25,450 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:12:25,451 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:25,451 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:25,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:12:25,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:25,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:12:25,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:12:25,452 INFO L87 Difference]: Start difference. First operand 14186 states and 44710 transitions. Second operand 4 states. [2019-12-27 18:12:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:25,486 INFO L93 Difference]: Finished difference Result 2296 states and 5226 transitions. [2019-12-27 18:12:25,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:12:25,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:12:25,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:25,491 INFO L225 Difference]: With dead ends: 2296 [2019-12-27 18:12:25,491 INFO L226 Difference]: Without dead ends: 2019 [2019-12-27 18:12:25,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-12-27 18:12:25,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2019. [2019-12-27 18:12:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-27 18:12:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4460 transitions. [2019-12-27 18:12:25,523 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4460 transitions. Word has length 25 [2019-12-27 18:12:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:25,524 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4460 transitions. [2019-12-27 18:12:25,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:12:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4460 transitions. [2019-12-27 18:12:25,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:12:25,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:25,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:25,528 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:25,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:25,528 INFO L82 PathProgramCache]: Analyzing trace with hash -568804126, now seen corresponding path program 1 times [2019-12-27 18:12:25,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:25,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484860189] [2019-12-27 18:12:25,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:25,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:25,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484860189] [2019-12-27 18:12:25,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:25,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:12:25,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1064185056] [2019-12-27 18:12:25,847 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:25,856 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:25,867 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-27 18:12:25,868 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:25,868 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:25,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:12:25,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:25,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:12:25,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:25,869 INFO L87 Difference]: Start difference. First operand 2019 states and 4460 transitions. Second operand 5 states. [2019-12-27 18:12:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:25,911 INFO L93 Difference]: Finished difference Result 416 states and 758 transitions. [2019-12-27 18:12:25,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:12:25,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 18:12:25,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:25,913 INFO L225 Difference]: With dead ends: 416 [2019-12-27 18:12:25,913 INFO L226 Difference]: Without dead ends: 371 [2019-12-27 18:12:25,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:12:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-27 18:12:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 343. [2019-12-27 18:12:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-27 18:12:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 618 transitions. [2019-12-27 18:12:25,919 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 618 transitions. Word has length 37 [2019-12-27 18:12:25,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:25,919 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 618 transitions. [2019-12-27 18:12:25,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:12:25,919 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 618 transitions. [2019-12-27 18:12:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:12:25,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:25,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:25,921 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:25,922 INFO L82 PathProgramCache]: Analyzing trace with hash -506418728, now seen corresponding path program 1 times [2019-12-27 18:12:25,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:25,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754351784] [2019-12-27 18:12:25,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:26,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754351784] [2019-12-27 18:12:26,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:26,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:12:26,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1641018593] [2019-12-27 18:12:26,045 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:26,060 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:26,093 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 112 transitions. [2019-12-27 18:12:26,093 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:26,094 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:26,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:12:26,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:26,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:12:26,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:12:26,095 INFO L87 Difference]: Start difference. First operand 343 states and 618 transitions. Second operand 3 states. [2019-12-27 18:12:26,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:26,139 INFO L93 Difference]: Finished difference Result 343 states and 617 transitions. [2019-12-27 18:12:26,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:12:26,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 18:12:26,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:26,140 INFO L225 Difference]: With dead ends: 343 [2019-12-27 18:12:26,140 INFO L226 Difference]: Without dead ends: 343 [2019-12-27 18:12:26,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:12:26,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-12-27 18:12:26,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-12-27 18:12:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-27 18:12:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 617 transitions. [2019-12-27 18:12:26,146 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 617 transitions. Word has length 52 [2019-12-27 18:12:26,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:26,146 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 617 transitions. [2019-12-27 18:12:26,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:12:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 617 transitions. [2019-12-27 18:12:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:12:26,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:26,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:26,148 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:26,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:26,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1294054807, now seen corresponding path program 1 times [2019-12-27 18:12:26,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:26,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798867606] [2019-12-27 18:12:26,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:26,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798867606] [2019-12-27 18:12:26,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:26,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:12:26,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [558685508] [2019-12-27 18:12:26,208 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:26,222 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:26,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 104 transitions. [2019-12-27 18:12:26,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:26,276 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:12:26,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:12:26,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:26,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:12:26,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:12:26,277 INFO L87 Difference]: Start difference. First operand 343 states and 617 transitions. Second operand 5 states. [2019-12-27 18:12:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:26,436 INFO L93 Difference]: Finished difference Result 438 states and 763 transitions. [2019-12-27 18:12:26,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:12:26,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 18:12:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:26,438 INFO L225 Difference]: With dead ends: 438 [2019-12-27 18:12:26,438 INFO L226 Difference]: Without dead ends: 438 [2019-12-27 18:12:26,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:12:26,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-27 18:12:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 331. [2019-12-27 18:12:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-12-27 18:12:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 581 transitions. [2019-12-27 18:12:26,445 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 581 transitions. Word has length 53 [2019-12-27 18:12:26,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:26,445 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 581 transitions. [2019-12-27 18:12:26,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:12:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 581 transitions. [2019-12-27 18:12:26,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:12:26,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:26,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:26,447 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:26,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:26,447 INFO L82 PathProgramCache]: Analyzing trace with hash -731863498, now seen corresponding path program 1 times [2019-12-27 18:12:26,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:26,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256016717] [2019-12-27 18:12:26,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:26,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256016717] [2019-12-27 18:12:26,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:26,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:12:26,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [944168478] [2019-12-27 18:12:26,620 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:26,635 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:26,662 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 74 transitions. [2019-12-27 18:12:26,662 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:26,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:12:26,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:12:26,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:26,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:12:26,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:12:26,665 INFO L87 Difference]: Start difference. First operand 331 states and 581 transitions. Second operand 7 states. [2019-12-27 18:12:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:26,766 INFO L93 Difference]: Finished difference Result 534 states and 938 transitions. [2019-12-27 18:12:26,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:12:26,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 18:12:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:26,768 INFO L225 Difference]: With dead ends: 534 [2019-12-27 18:12:26,768 INFO L226 Difference]: Without dead ends: 245 [2019-12-27 18:12:26,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:12:26,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-12-27 18:12:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 221. [2019-12-27 18:12:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-27 18:12:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 391 transitions. [2019-12-27 18:12:26,772 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 391 transitions. Word has length 54 [2019-12-27 18:12:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:26,772 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 391 transitions. [2019-12-27 18:12:26,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:12:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 391 transitions. [2019-12-27 18:12:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:12:26,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:26,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:26,774 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:26,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:26,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1034362442, now seen corresponding path program 2 times [2019-12-27 18:12:26,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:26,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697948463] [2019-12-27 18:12:26,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:27,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697948463] [2019-12-27 18:12:27,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:27,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:12:27,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1791759984] [2019-12-27 18:12:27,212 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:27,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:27,265 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 115 transitions. [2019-12-27 18:12:27,266 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:27,415 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:12:27,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 18:12:27,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:27,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 18:12:27,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:12:27,416 INFO L87 Difference]: Start difference. First operand 221 states and 391 transitions. Second operand 15 states. [2019-12-27 18:12:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:29,198 INFO L93 Difference]: Finished difference Result 566 states and 960 transitions. [2019-12-27 18:12:29,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 18:12:29,199 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-27 18:12:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:29,201 INFO L225 Difference]: With dead ends: 566 [2019-12-27 18:12:29,201 INFO L226 Difference]: Without dead ends: 533 [2019-12-27 18:12:29,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=267, Invalid=1293, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 18:12:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-12-27 18:12:29,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 321. [2019-12-27 18:12:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-27 18:12:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 562 transitions. [2019-12-27 18:12:29,208 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 562 transitions. Word has length 54 [2019-12-27 18:12:29,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:29,209 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 562 transitions. [2019-12-27 18:12:29,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 18:12:29,209 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 562 transitions. [2019-12-27 18:12:29,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:12:29,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:29,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:29,210 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:29,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:29,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1326135034, now seen corresponding path program 3 times [2019-12-27 18:12:29,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:29,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872974583] [2019-12-27 18:12:29,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:12:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:12:29,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872974583] [2019-12-27 18:12:29,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:12:29,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:12:29,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [379177588] [2019-12-27 18:12:29,481 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:12:29,504 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:12:29,556 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 114 transitions. [2019-12-27 18:12:29,556 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:12:29,614 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:12:29,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:12:29,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:12:29,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:12:29,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:12:29,615 INFO L87 Difference]: Start difference. First operand 321 states and 562 transitions. Second operand 14 states. [2019-12-27 18:12:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:12:30,012 INFO L93 Difference]: Finished difference Result 424 states and 716 transitions. [2019-12-27 18:12:30,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:12:30,012 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 18:12:30,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:12:30,013 INFO L225 Difference]: With dead ends: 424 [2019-12-27 18:12:30,013 INFO L226 Difference]: Without dead ends: 391 [2019-12-27 18:12:30,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-27 18:12:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-12-27 18:12:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 329. [2019-12-27 18:12:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 18:12:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 576 transitions. [2019-12-27 18:12:30,020 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 576 transitions. Word has length 54 [2019-12-27 18:12:30,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:12:30,020 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 576 transitions. [2019-12-27 18:12:30,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:12:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 576 transitions. [2019-12-27 18:12:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:12:30,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:12:30,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:12:30,022 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:12:30,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:12:30,022 INFO L82 PathProgramCache]: Analyzing trace with hash -91775718, now seen corresponding path program 4 times [2019-12-27 18:12:30,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:12:30,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917342332] [2019-12-27 18:12:30,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:12:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:12:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:12:30,125 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:12:30,126 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:12:30,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff1_thd0~0_329 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2011~0.base_24| 1)) (= v_~y$w_buff0_used~0_834 0) (= 0 v_~__unbuffered_cnt~0_61) (= 0 v_~weak$$choice0~0_14) (= v_~y$r_buff1_thd1~0_200 0) (= 0 v_~x~0_147) (= |v_#NULL.offset_3| 0) (= v_~main$tmp_guard1~0_27 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2011~0.base_24|) 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2011~0.base_24|) (= 0 v_~y$r_buff1_thd2~0_208) (= 0 v_~y$r_buff0_thd2~0_162) (= v_~y$mem_tmp~0_19 0) (= |v_ULTIMATE.start_main_~#t2011~0.offset_19| 0) (= v_~weak$$choice2~0_141 0) (= v_~y$w_buff1_used~0_547 0) (= v_~y$r_buff0_thd1~0_297 0) (= 0 v_~y$flush_delayed~0_36) (= v_~main$tmp_guard0~0_33 0) (= 0 |v_#NULL.base_3|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2011~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2011~0.base_24|) |v_ULTIMATE.start_main_~#t2011~0.offset_19| 0))) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2011~0.base_24| 4) |v_#length_13|) (= 0 v_~y$w_buff0~0_485) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff0_thd0~0_416 0) (= v_~y~0_146 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~y$w_buff1~0_308 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_41|, ULTIMATE.start_main_~#t2011~0.base=|v_ULTIMATE.start_main_~#t2011~0.base_24|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_145|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_297, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, #length=|v_#length_13|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_36|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_21|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_41|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_44|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_38|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_308, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_329, ~x~0=v_~x~0_147, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_834, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ULTIMATE.start_main_~#t2012~0.offset=|v_ULTIMATE.start_main_~#t2012~0.offset_16|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_33|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_200, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ULTIMATE.start_main_~#t2012~0.base=|v_ULTIMATE.start_main_~#t2012~0.base_19|, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y~0=v_~y~0_146, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_~#t2011~0.offset=|v_ULTIMATE.start_main_~#t2011~0.offset_19|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_35|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_208, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_416, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_14|, ~weak$$choice2~0=v_~weak$$choice2~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2011~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t2012~0.offset, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t2012~0.base, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_~#t2011~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:12:30,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L779-1-->L781: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2012~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2012~0.base_11|) |v_ULTIMATE.start_main_~#t2012~0.offset_10| 1)) |v_#memory_int_7|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2012~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t2012~0.base_11| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2012~0.base_11| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t2012~0.offset_10| 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2012~0.base_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2012~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2012~0.base=|v_ULTIMATE.start_main_~#t2012~0.base_11|, ULTIMATE.start_main_~#t2012~0.offset=|v_ULTIMATE.start_main_~#t2012~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2012~0.base, ULTIMATE.start_main_~#t2012~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 18:12:30,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1~0_121 v_~y$w_buff0~0_204) (= 2 v_~y$w_buff0~0_203) (= v_P0Thread1of1ForFork0_~arg.base_96 |v_P0Thread1of1ForFork0_#in~arg.base_96|) (= 0 (mod v_~y$w_buff1_used~0_210 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_P0Thread1of1ForFork0_~arg.offset_96 |v_P0Thread1of1ForFork0_#in~arg.offset_96|) (= v_~y$w_buff0_used~0_350 v_~y$w_buff1_used~0_210) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|) (= v_~y$w_buff0_used~0_349 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_204, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_96|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_349, ~y$w_buff1~0=v_~y$w_buff1~0_121, ~y$w_buff0~0=v_~y$w_buff0~0_203, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_100, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_96|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_96, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_96|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_96, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_210} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:12:30,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In563510053 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In563510053 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out563510053| ~y$w_buff1~0_In563510053) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out563510053| ~y~0_In563510053) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In563510053, ~y$w_buff1~0=~y$w_buff1~0_In563510053, ~y~0=~y~0_In563510053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In563510053} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In563510053, ~y$w_buff1~0=~y$w_buff1~0_In563510053, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out563510053|, ~y~0=~y~0_In563510053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In563510053} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 18:12:30,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= v_~y~0_41 |v_P1Thread1of1ForFork1_#t~ite9_10|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_10|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_9|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_15|, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 18:12:30,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-116536008 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-116536008 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-116536008 |P1Thread1of1ForFork1_#t~ite11_Out-116536008|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-116536008| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-116536008, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-116536008} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-116536008, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-116536008, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-116536008|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:12:30,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In570552776 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In570552776 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In570552776 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In570552776 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out570552776| ~y$w_buff1_used~0_In570552776) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out570552776| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In570552776, ~y$w_buff0_used~0=~y$w_buff0_used~0_In570552776, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In570552776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In570552776} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In570552776, ~y$w_buff0_used~0=~y$w_buff0_used~0_In570552776, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In570552776, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out570552776|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In570552776} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:12:30,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1947577741 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1947577741 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In1947577741 |P1Thread1of1ForFork1_#t~ite13_Out1947577741|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1947577741|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1947577741, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1947577741} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1947577741, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1947577741, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1947577741|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 18:12:30,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1360740081 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1360740081 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1360740081 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1360740081 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1360740081 |P1Thread1of1ForFork1_#t~ite14_Out-1360740081|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1360740081|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1360740081, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1360740081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1360740081, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1360740081} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1360740081, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1360740081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1360740081, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1360740081|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1360740081} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:12:30,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~y$r_buff1_thd2~0_91) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_91, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 18:12:30,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1161399998 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1161399998 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1161399998| 0)) (and (= ~y$w_buff0_used~0_In-1161399998 |P0Thread1of1ForFork0_#t~ite5_Out-1161399998|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1161399998, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1161399998} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1161399998|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1161399998, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1161399998} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:12:30,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2134062698 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2134062698 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-2134062698 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-2134062698 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-2134062698|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-2134062698 |P0Thread1of1ForFork0_#t~ite6_Out-2134062698|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2134062698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2134062698, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2134062698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2134062698} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2134062698|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2134062698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2134062698, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2134062698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2134062698} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:12:30,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1381657299 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1381657299 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1381657299 ~y$r_buff0_thd1~0_Out-1381657299)) (and (= 0 ~y$r_buff0_thd1~0_Out-1381657299) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1381657299, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1381657299} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1381657299, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1381657299|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1381657299} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:12:30,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-2095444268 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-2095444268 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-2095444268 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-2095444268 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-2095444268|)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-2095444268| ~y$r_buff1_thd1~0_In-2095444268) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2095444268, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2095444268, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2095444268, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2095444268} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-2095444268, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2095444268, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2095444268|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2095444268, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2095444268} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:12:30,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L740-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_80, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 18:12:30,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 18:12:30,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite17_Out1909093746| |ULTIMATE.start_main_#t~ite18_Out1909093746|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1909093746 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1909093746 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite17_Out1909093746| ~y$w_buff1~0_In1909093746) (not .cse1) (not .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite17_Out1909093746| ~y~0_In1909093746) (or .cse2 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1909093746, ~y~0=~y~0_In1909093746, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1909093746, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1909093746} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1909093746|, ~y$w_buff1~0=~y$w_buff1~0_In1909093746, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1909093746|, ~y~0=~y~0_In1909093746, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1909093746, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1909093746} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 18:12:30,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1891281984 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1891281984 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1891281984 |ULTIMATE.start_main_#t~ite19_Out-1891281984|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out-1891281984|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1891281984, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1891281984} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1891281984, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1891281984|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1891281984} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 18:12:30,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-115851850 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-115851850 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-115851850 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-115851850 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-115851850|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out-115851850| ~y$w_buff1_used~0_In-115851850) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-115851850, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-115851850, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-115851850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-115851850} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-115851850, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-115851850, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-115851850|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-115851850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-115851850} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 18:12:30,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1659990637 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1659990637 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1659990637|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-1659990637 |ULTIMATE.start_main_#t~ite21_Out-1659990637|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1659990637, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1659990637} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1659990637, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1659990637, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1659990637|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 18:12:30,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In438984902 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In438984902 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In438984902 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In438984902 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out438984902|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite22_Out438984902| ~y$r_buff1_thd0~0_In438984902) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In438984902, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In438984902, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In438984902, ~y$w_buff1_used~0=~y$w_buff1_used~0_In438984902} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In438984902, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In438984902, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In438984902, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out438984902|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In438984902} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 18:12:30,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-920799879 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite32_Out-920799879| ~y$w_buff1~0_In-920799879) (= |ULTIMATE.start_main_#t~ite31_In-920799879| |ULTIMATE.start_main_#t~ite31_Out-920799879|)) (and (= ~y$w_buff1~0_In-920799879 |ULTIMATE.start_main_#t~ite31_Out-920799879|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-920799879 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-920799879 256))) (= (mod ~y$w_buff0_used~0_In-920799879 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-920799879 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite32_Out-920799879| |ULTIMATE.start_main_#t~ite31_Out-920799879|) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-920799879, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-920799879, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-920799879, ~weak$$choice2~0=~weak$$choice2~0_In-920799879, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-920799879|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-920799879, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-920799879} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-920799879, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-920799879, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-920799879, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-920799879|, ~weak$$choice2~0=~weak$$choice2~0_In-920799879, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-920799879|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-920799879, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-920799879} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 18:12:30,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (= v_~y$r_buff0_thd0~0_162 v_~y$r_buff0_thd0~0_163) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 18:12:30,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_24) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_12 256)) (not (= 0 (mod v_~y$flush_delayed~0_25 256))) (= v_~y~0_106 v_~y$mem_tmp~0_13)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_106, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:12:30,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:12:30,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:12:30 BasicIcfg [2019-12-27 18:12:30,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:12:30,244 INFO L168 Benchmark]: Toolchain (without parser) took 18707.96 ms. Allocated memory was 144.7 MB in the beginning and 781.7 MB in the end (delta: 637.0 MB). Free memory was 101.2 MB in the beginning and 461.9 MB in the end (delta: -360.8 MB). Peak memory consumption was 276.2 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:30,244 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 18:12:30,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.09 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.9 MB in the beginning and 153.7 MB in the end (delta: -52.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:30,246 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.36 ms. Allocated memory is still 201.3 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:30,246 INFO L168 Benchmark]: Boogie Preprocessor took 35.14 ms. Allocated memory is still 201.3 MB. Free memory was 151.0 MB in the beginning and 149.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:30,249 INFO L168 Benchmark]: RCFGBuilder took 811.83 ms. Allocated memory is still 201.3 MB. Free memory was 148.3 MB in the beginning and 104.8 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:30,250 INFO L168 Benchmark]: TraceAbstraction took 17004.05 ms. Allocated memory was 201.3 MB in the beginning and 781.7 MB in the end (delta: 580.4 MB). Free memory was 104.1 MB in the beginning and 461.9 MB in the end (delta: -357.8 MB). Peak memory consumption was 222.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:12:30,260 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.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.09 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.9 MB in the beginning and 153.7 MB in the end (delta: -52.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.36 ms. Allocated memory is still 201.3 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.14 ms. Allocated memory is still 201.3 MB. Free memory was 151.0 MB in the beginning and 149.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 811.83 ms. Allocated memory is still 201.3 MB. Free memory was 148.3 MB in the beginning and 104.8 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17004.05 ms. Allocated memory was 201.3 MB in the beginning and 781.7 MB in the end (delta: 580.4 MB). Free memory was 104.1 MB in the beginning and 461.9 MB in the end (delta: -357.8 MB). Peak memory consumption was 222.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 146 ProgramPointsBefore, 79 ProgramPointsAfterwards, 180 TransitionsBefore, 91 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 3678 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 69 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 46090 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2011, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2012, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.7s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1253 SDtfs, 1496 SDslu, 2964 SDs, 0 SdLazy, 1670 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14186occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 9475 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 450 NumberOfCodeBlocks, 450 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 77607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...