/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:35:55,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:35:55,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:35:55,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:35:55,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:35:55,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:35:55,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:35:55,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:35:55,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:35:55,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:35:55,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:35:55,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:35:55,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:35:55,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:35:55,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:35:55,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:35:55,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:35:55,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:35:55,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:35:55,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:35:55,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:35:55,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:35:55,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:35:55,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:35:55,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:35:55,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:35:55,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:35:55,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:35:55,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:35:55,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:35:55,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:35:55,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:35:55,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:35:55,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:35:55,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:35:55,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:35:55,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:35:55,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:35:55,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:35:55,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:35:55,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:35:55,421 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:35:55,435 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:35:55,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:35:55,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:35:55,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:35:55,437 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:35:55,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:35:55,438 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:35:55,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:35:55,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:35:55,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:35:55,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:35:55,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:35:55,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:35:55,439 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:35:55,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:35:55,439 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:35:55,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:35:55,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:35:55,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:35:55,440 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:35:55,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:35:55,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:35:55,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:35:55,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:35:55,441 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:35:55,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:35:55,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:35:55,442 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:35:55,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:35:55,442 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:35:55,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:35:55,752 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:35:55,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:35:55,758 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:35:55,758 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:35:55,759 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2019-12-27 06:35:55,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0d96bf4d/1d1bf7f082cb429d8b2a0eb7be8bd2d7/FLAG235ef56fd [2019-12-27 06:35:56,385 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:35:56,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.oepc.i [2019-12-27 06:35:56,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0d96bf4d/1d1bf7f082cb429d8b2a0eb7be8bd2d7/FLAG235ef56fd [2019-12-27 06:35:56,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0d96bf4d/1d1bf7f082cb429d8b2a0eb7be8bd2d7 [2019-12-27 06:35:56,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:35:56,654 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:35:56,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:35:56,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:35:56,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:35:56,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:35:56" (1/1) ... [2019-12-27 06:35:56,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d944e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:56, skipping insertion in model container [2019-12-27 06:35:56,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:35:56" (1/1) ... [2019-12-27 06:35:56,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:35:56,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:35:57,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:35:57,318 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:35:57,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:35:57,462 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:35:57,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:57 WrapperNode [2019-12-27 06:35:57,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:35:57,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:35:57,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:35:57,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:35:57,472 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:35:57" (1/1) ... [2019-12-27 06:35:57,493 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:35:57" (1/1) ... [2019-12-27 06:35:57,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:35:57,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:35:57,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:35:57,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:35:57,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:57" (1/1) ... [2019-12-27 06:35:57,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:57" (1/1) ... [2019-12-27 06:35:57,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:57" (1/1) ... [2019-12-27 06:35:57,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:57" (1/1) ... [2019-12-27 06:35:57,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:57" (1/1) ... [2019-12-27 06:35:57,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:57" (1/1) ... [2019-12-27 06:35:57,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:57" (1/1) ... [2019-12-27 06:35:57,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:35:57,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:35:57,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:35:57,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:35:57,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:57" (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 06:35:57,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:35:57,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:35:57,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:35:57,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:35:57,655 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:35:57,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:35:57,655 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:35:57,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:35:57,656 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:35:57,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:35:57,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:35:57,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:35:57,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:35:57,659 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 06:35:58,431 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:35:58,431 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:35:58,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:35:58 BoogieIcfgContainer [2019-12-27 06:35:58,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:35:58,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:35:58,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:35:58,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:35:58,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:35:56" (1/3) ... [2019-12-27 06:35:58,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375b2a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:35:58, skipping insertion in model container [2019-12-27 06:35:58,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:35:57" (2/3) ... [2019-12-27 06:35:58,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375b2a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:35:58, skipping insertion in model container [2019-12-27 06:35:58,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:35:58" (3/3) ... [2019-12-27 06:35:58,444 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_tso.oepc.i [2019-12-27 06:35:58,454 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:35:58,455 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:35:58,464 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:35:58,465 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:35:58,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,504 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,504 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,510 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,510 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,518 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,519 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,519 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,519 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,520 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,532 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,533 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,537 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,537 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,539 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,539 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:35:58,558 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:35:58,580 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:35:58,580 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:35:58,580 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:35:58,580 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:35:58,580 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:35:58,581 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:35:58,581 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:35:58,581 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:35:58,601 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 06:35:58,604 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 06:35:58,749 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 06:35:58,749 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:35:58,764 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:35:58,778 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 06:35:58,871 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 06:35:58,872 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:35:58,880 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:35:58,896 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 06:35:58,897 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:36:02,423 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 06:36:02,546 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 06:36:02,566 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48939 [2019-12-27 06:36:02,566 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 06:36:02,569 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 93 transitions [2019-12-27 06:36:03,609 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 17702 states. [2019-12-27 06:36:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 17702 states. [2019-12-27 06:36:03,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 06:36:03,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:03,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:03,619 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:03,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:03,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1021258717, now seen corresponding path program 1 times [2019-12-27 06:36:03,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:03,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630129801] [2019-12-27 06:36:03,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:03,897 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 06:36:03,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630129801] [2019-12-27 06:36:03,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:03,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:36:03,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82764851] [2019-12-27 06:36:03,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:36:03,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:03,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:36:03,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:03,924 INFO L87 Difference]: Start difference. First operand 17702 states. Second operand 3 states. [2019-12-27 06:36:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:04,913 INFO L93 Difference]: Finished difference Result 17518 states and 65786 transitions. [2019-12-27 06:36:04,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:36:04,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 06:36:04,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:05,151 INFO L225 Difference]: With dead ends: 17518 [2019-12-27 06:36:05,154 INFO L226 Difference]: Without dead ends: 17154 [2019-12-27 06:36:05,155 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 06:36:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states. [2019-12-27 06:36:05,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2019-12-27 06:36:05,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17154 states. [2019-12-27 06:36:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 64484 transitions. [2019-12-27 06:36:06,057 INFO L78 Accepts]: Start accepts. Automaton has 17154 states and 64484 transitions. Word has length 7 [2019-12-27 06:36:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:06,058 INFO L462 AbstractCegarLoop]: Abstraction has 17154 states and 64484 transitions. [2019-12-27 06:36:06,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:36:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 17154 states and 64484 transitions. [2019-12-27 06:36:06,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:36:06,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:06,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:06,071 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:06,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:06,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1042029575, now seen corresponding path program 1 times [2019-12-27 06:36:06,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:06,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988158042] [2019-12-27 06:36:06,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:06,190 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 06:36:06,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988158042] [2019-12-27 06:36:06,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:06,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:36:06,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712014859] [2019-12-27 06:36:06,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:36:06,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:06,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:36:06,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:36:06,193 INFO L87 Difference]: Start difference. First operand 17154 states and 64484 transitions. Second operand 4 states. [2019-12-27 06:36:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:06,897 INFO L93 Difference]: Finished difference Result 26570 states and 95594 transitions. [2019-12-27 06:36:06,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:36:06,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:36:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:07,022 INFO L225 Difference]: With dead ends: 26570 [2019-12-27 06:36:07,022 INFO L226 Difference]: Without dead ends: 26556 [2019-12-27 06:36:07,025 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 06:36:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26556 states. [2019-12-27 06:36:08,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26556 to 24300. [2019-12-27 06:36:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24300 states. [2019-12-27 06:36:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24300 states to 24300 states and 88453 transitions. [2019-12-27 06:36:08,936 INFO L78 Accepts]: Start accepts. Automaton has 24300 states and 88453 transitions. Word has length 13 [2019-12-27 06:36:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:08,937 INFO L462 AbstractCegarLoop]: Abstraction has 24300 states and 88453 transitions. [2019-12-27 06:36:08,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:36:08,937 INFO L276 IsEmpty]: Start isEmpty. Operand 24300 states and 88453 transitions. [2019-12-27 06:36:08,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:36:08,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:08,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:08,939 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:08,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:08,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1362987190, now seen corresponding path program 1 times [2019-12-27 06:36:08,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:08,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864443045] [2019-12-27 06:36:08,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:09,031 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 06:36:09,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864443045] [2019-12-27 06:36:09,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:09,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:36:09,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29572846] [2019-12-27 06:36:09,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:36:09,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:09,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:36:09,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:09,034 INFO L87 Difference]: Start difference. First operand 24300 states and 88453 transitions. Second operand 3 states. [2019-12-27 06:36:09,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:09,091 INFO L93 Difference]: Finished difference Result 13809 states and 43497 transitions. [2019-12-27 06:36:09,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:36:09,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:36:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:09,142 INFO L225 Difference]: With dead ends: 13809 [2019-12-27 06:36:09,143 INFO L226 Difference]: Without dead ends: 13809 [2019-12-27 06:36:09,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:09,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13809 states. [2019-12-27 06:36:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13809 to 13809. [2019-12-27 06:36:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-27 06:36:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 43497 transitions. [2019-12-27 06:36:09,562 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 43497 transitions. Word has length 13 [2019-12-27 06:36:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:09,562 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 43497 transitions. [2019-12-27 06:36:09,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:36:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 43497 transitions. [2019-12-27 06:36:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:36:09,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:09,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:09,564 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:09,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:09,565 INFO L82 PathProgramCache]: Analyzing trace with hash -824782782, now seen corresponding path program 1 times [2019-12-27 06:36:09,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:09,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635847844] [2019-12-27 06:36:09,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:09,613 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 06:36:09,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635847844] [2019-12-27 06:36:09,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:09,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:36:09,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368017324] [2019-12-27 06:36:09,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:36:09,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:09,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:36:09,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:36:09,616 INFO L87 Difference]: Start difference. First operand 13809 states and 43497 transitions. Second operand 4 states. [2019-12-27 06:36:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:09,645 INFO L93 Difference]: Finished difference Result 2006 states and 4674 transitions. [2019-12-27 06:36:09,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:36:09,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:36:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:09,652 INFO L225 Difference]: With dead ends: 2006 [2019-12-27 06:36:09,652 INFO L226 Difference]: Without dead ends: 2006 [2019-12-27 06:36:09,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:36:09,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-12-27 06:36:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 2006. [2019-12-27 06:36:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2019-12-27 06:36:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 4674 transitions. [2019-12-27 06:36:09,688 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 4674 transitions. Word has length 14 [2019-12-27 06:36:09,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:09,688 INFO L462 AbstractCegarLoop]: Abstraction has 2006 states and 4674 transitions. [2019-12-27 06:36:09,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:36:09,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 4674 transitions. [2019-12-27 06:36:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:36:09,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:09,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:09,691 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:09,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:09,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1888947731, now seen corresponding path program 1 times [2019-12-27 06:36:09,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:09,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678599655] [2019-12-27 06:36:09,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:09,752 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 06:36:09,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678599655] [2019-12-27 06:36:09,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:09,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:36:09,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467406001] [2019-12-27 06:36:09,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:36:09,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:09,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:36:09,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:36:09,754 INFO L87 Difference]: Start difference. First operand 2006 states and 4674 transitions. Second operand 5 states. [2019-12-27 06:36:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:09,781 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-27 06:36:09,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:36:09,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 06:36:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:09,784 INFO L225 Difference]: With dead ends: 653 [2019-12-27 06:36:09,784 INFO L226 Difference]: Without dead ends: 653 [2019-12-27 06:36:09,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:36:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-27 06:36:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-27 06:36:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-27 06:36:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-27 06:36:09,945 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-27 06:36:09,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:09,946 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-27 06:36:09,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:36:09,946 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-27 06:36:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:36:09,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:09,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:09,949 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:09,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:09,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1558229958, now seen corresponding path program 1 times [2019-12-27 06:36:09,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:09,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944627722] [2019-12-27 06:36:09,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:10,085 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 06:36:10,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944627722] [2019-12-27 06:36:10,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:10,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:36:10,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609945562] [2019-12-27 06:36:10,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:36:10,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:10,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:36:10,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:10,089 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-27 06:36:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:10,138 INFO L93 Difference]: Finished difference Result 609 states and 1418 transitions. [2019-12-27 06:36:10,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:36:10,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 06:36:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:10,141 INFO L225 Difference]: With dead ends: 609 [2019-12-27 06:36:10,141 INFO L226 Difference]: Without dead ends: 609 [2019-12-27 06:36:10,142 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 06:36:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-27 06:36:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-27 06:36:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 06:36:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1414 transitions. [2019-12-27 06:36:10,153 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1414 transitions. Word has length 55 [2019-12-27 06:36:10,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:10,154 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1414 transitions. [2019-12-27 06:36:10,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:36:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1414 transitions. [2019-12-27 06:36:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:36:10,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:10,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:10,156 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:10,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:10,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1993278178, now seen corresponding path program 1 times [2019-12-27 06:36:10,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:10,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806924431] [2019-12-27 06:36:10,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:10,236 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 06:36:10,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806924431] [2019-12-27 06:36:10,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:10,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:36:10,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803624864] [2019-12-27 06:36:10,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:36:10,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:10,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:36:10,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:10,238 INFO L87 Difference]: Start difference. First operand 605 states and 1414 transitions. Second operand 3 states. [2019-12-27 06:36:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:10,286 INFO L93 Difference]: Finished difference Result 609 states and 1411 transitions. [2019-12-27 06:36:10,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:36:10,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 06:36:10,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:10,289 INFO L225 Difference]: With dead ends: 609 [2019-12-27 06:36:10,289 INFO L226 Difference]: Without dead ends: 609 [2019-12-27 06:36:10,289 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 06:36:10,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-27 06:36:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-27 06:36:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 06:36:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1407 transitions. [2019-12-27 06:36:10,300 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1407 transitions. Word has length 55 [2019-12-27 06:36:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:10,300 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1407 transitions. [2019-12-27 06:36:10,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:36:10,301 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1407 transitions. [2019-12-27 06:36:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:36:10,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:10,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:10,303 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:10,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:10,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1988838358, now seen corresponding path program 1 times [2019-12-27 06:36:10,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:10,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040110971] [2019-12-27 06:36:10,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:10,413 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 06:36:10,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040110971] [2019-12-27 06:36:10,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:10,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:36:10,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989413898] [2019-12-27 06:36:10,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:36:10,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:10,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:36:10,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:36:10,415 INFO L87 Difference]: Start difference. First operand 605 states and 1407 transitions. Second operand 5 states. [2019-12-27 06:36:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:10,642 INFO L93 Difference]: Finished difference Result 894 states and 2079 transitions. [2019-12-27 06:36:10,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:36:10,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 06:36:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:10,644 INFO L225 Difference]: With dead ends: 894 [2019-12-27 06:36:10,644 INFO L226 Difference]: Without dead ends: 894 [2019-12-27 06:36:10,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:36:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-27 06:36:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-27 06:36:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-27 06:36:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1688 transitions. [2019-12-27 06:36:10,658 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1688 transitions. Word has length 55 [2019-12-27 06:36:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:10,658 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1688 transitions. [2019-12-27 06:36:10,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:36:10,659 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1688 transitions. [2019-12-27 06:36:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:36:10,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:10,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:10,662 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:10,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:10,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2112589232, now seen corresponding path program 2 times [2019-12-27 06:36:10,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:10,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794945568] [2019-12-27 06:36:10,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:10,797 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 06:36:10,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794945568] [2019-12-27 06:36:10,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:10,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:36:10,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405729121] [2019-12-27 06:36:10,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:36:10,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:10,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:36:10,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:10,799 INFO L87 Difference]: Start difference. First operand 719 states and 1688 transitions. Second operand 3 states. [2019-12-27 06:36:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:10,844 INFO L93 Difference]: Finished difference Result 719 states and 1687 transitions. [2019-12-27 06:36:10,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:36:10,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 06:36:10,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:10,846 INFO L225 Difference]: With dead ends: 719 [2019-12-27 06:36:10,846 INFO L226 Difference]: Without dead ends: 719 [2019-12-27 06:36:10,846 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 06:36:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-12-27 06:36:10,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 536. [2019-12-27 06:36:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 06:36:10,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1264 transitions. [2019-12-27 06:36:10,860 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1264 transitions. Word has length 55 [2019-12-27 06:36:10,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:10,861 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1264 transitions. [2019-12-27 06:36:10,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:36:10,861 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1264 transitions. [2019-12-27 06:36:10,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 06:36:10,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:10,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:10,865 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:10,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:10,866 INFO L82 PathProgramCache]: Analyzing trace with hash 966806383, now seen corresponding path program 1 times [2019-12-27 06:36:10,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:10,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541696956] [2019-12-27 06:36:10,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:10,963 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 06:36:10,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541696956] [2019-12-27 06:36:10,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:10,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:36:10,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404271463] [2019-12-27 06:36:10,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:36:10,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:10,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:36:10,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:10,965 INFO L87 Difference]: Start difference. First operand 536 states and 1264 transitions. Second operand 3 states. [2019-12-27 06:36:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:10,979 INFO L93 Difference]: Finished difference Result 512 states and 1174 transitions. [2019-12-27 06:36:10,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:36:10,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 06:36:10,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:10,980 INFO L225 Difference]: With dead ends: 512 [2019-12-27 06:36:10,980 INFO L226 Difference]: Without dead ends: 512 [2019-12-27 06:36:10,981 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 06:36:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-12-27 06:36:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 476. [2019-12-27 06:36:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-27 06:36:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1088 transitions. [2019-12-27 06:36:10,992 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1088 transitions. Word has length 56 [2019-12-27 06:36:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:10,995 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 1088 transitions. [2019-12-27 06:36:10,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:36:10,995 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1088 transitions. [2019-12-27 06:36:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:36:10,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:10,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:10,997 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:10,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:10,997 INFO L82 PathProgramCache]: Analyzing trace with hash 693794399, now seen corresponding path program 1 times [2019-12-27 06:36:10,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:10,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500334945] [2019-12-27 06:36:10,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:11,183 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 06:36:11,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500334945] [2019-12-27 06:36:11,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:11,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:36:11,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103314587] [2019-12-27 06:36:11,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:36:11,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:11,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:36:11,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:36:11,188 INFO L87 Difference]: Start difference. First operand 476 states and 1088 transitions. Second operand 6 states. [2019-12-27 06:36:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:11,277 INFO L93 Difference]: Finished difference Result 785 states and 1685 transitions. [2019-12-27 06:36:11,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:36:11,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 06:36:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:11,279 INFO L225 Difference]: With dead ends: 785 [2019-12-27 06:36:11,279 INFO L226 Difference]: Without dead ends: 313 [2019-12-27 06:36:11,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:36:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-12-27 06:36:11,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 280. [2019-12-27 06:36:11,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-27 06:36:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 501 transitions. [2019-12-27 06:36:11,284 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 501 transitions. Word has length 57 [2019-12-27 06:36:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:11,285 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 501 transitions. [2019-12-27 06:36:11,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:36:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 501 transitions. [2019-12-27 06:36:11,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:36:11,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:11,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:11,286 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:11,287 INFO L82 PathProgramCache]: Analyzing trace with hash 776087573, now seen corresponding path program 2 times [2019-12-27 06:36:11,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:11,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451476250] [2019-12-27 06:36:11,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:12,083 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 06:36:12,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451476250] [2019-12-27 06:36:12,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:12,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 06:36:12,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662513023] [2019-12-27 06:36:12,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 06:36:12,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:12,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 06:36:12,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-12-27 06:36:12,086 INFO L87 Difference]: Start difference. First operand 280 states and 501 transitions. Second operand 20 states. [2019-12-27 06:36:12,416 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-12-27 06:36:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:13,945 INFO L93 Difference]: Finished difference Result 683 states and 1216 transitions. [2019-12-27 06:36:13,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 06:36:13,946 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2019-12-27 06:36:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:13,947 INFO L225 Difference]: With dead ends: 683 [2019-12-27 06:36:13,947 INFO L226 Difference]: Without dead ends: 649 [2019-12-27 06:36:13,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 06:36:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-12-27 06:36:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 386. [2019-12-27 06:36:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-12-27 06:36:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 682 transitions. [2019-12-27 06:36:13,954 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 682 transitions. Word has length 57 [2019-12-27 06:36:13,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:13,954 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 682 transitions. [2019-12-27 06:36:13,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 06:36:13,955 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 682 transitions. [2019-12-27 06:36:13,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:36:13,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:13,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:13,956 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:13,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:13,957 INFO L82 PathProgramCache]: Analyzing trace with hash 155274265, now seen corresponding path program 3 times [2019-12-27 06:36:13,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:13,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620475793] [2019-12-27 06:36:13,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:14,210 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 06:36:14,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620475793] [2019-12-27 06:36:14,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:14,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:36:14,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216152284] [2019-12-27 06:36:14,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:36:14,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:14,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:36:14,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:36:14,212 INFO L87 Difference]: Start difference. First operand 386 states and 682 transitions. Second operand 14 states. [2019-12-27 06:36:14,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:14,965 INFO L93 Difference]: Finished difference Result 678 states and 1170 transitions. [2019-12-27 06:36:14,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:36:14,965 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 06:36:14,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:14,967 INFO L225 Difference]: With dead ends: 678 [2019-12-27 06:36:14,967 INFO L226 Difference]: Without dead ends: 644 [2019-12-27 06:36:14,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2019-12-27 06:36:14,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-12-27 06:36:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 414. [2019-12-27 06:36:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-12-27 06:36:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 736 transitions. [2019-12-27 06:36:14,976 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 736 transitions. Word has length 57 [2019-12-27 06:36:14,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:14,976 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 736 transitions. [2019-12-27 06:36:14,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:36:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 736 transitions. [2019-12-27 06:36:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:36:14,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:14,978 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:14,978 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:14,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1732220053, now seen corresponding path program 4 times [2019-12-27 06:36:14,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:14,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358045519] [2019-12-27 06:36:14,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:36:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:36:15,246 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:36:15,247 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:36:15,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$w_buff1~0_26) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~y$r_buff0_thd2~0_20 0) (= v_~main$tmp_guard0~0_9 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1211~0.base_25|) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~y$r_buff1_thd0~0_51) (= v_~y$w_buff0_used~0_108 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~y$flush_delayed~0_14) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1211~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1211~0.base_25|) |v_ULTIMATE.start_main_~#t1211~0.offset_19| 0)) |v_#memory_int_21|) (= v_~y$r_buff0_thd3~0_26 0) (= 0 v_~y$w_buff0~0_29) (= v_~y$r_buff1_thd1~0_9 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1211~0.base_25| 4) |v_#length_23|) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y$r_buff0_thd0~0_80 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t1211~0.base_25| 1)) (= 0 v_~z~0_9) (= 0 v_~__unbuffered_cnt~0_22) (= |v_ULTIMATE.start_main_~#t1211~0.offset_19| 0) (= v_~y$mem_tmp~0_10 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1211~0.base_25|)) (= v_~x~0_12 0) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$r_buff1_thd3~0_19) (= v_~y~0_26 0) (= v_~y$r_buff0_thd1~0_6 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1213~0.base=|v_ULTIMATE.start_main_~#t1213~0.base_25|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start_main_~#t1213~0.offset=|v_ULTIMATE.start_main_~#t1213~0.offset_19|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ULTIMATE.start_main_~#t1211~0.base=|v_ULTIMATE.start_main_~#t1211~0.base_25|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_26, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1212~0.base=|v_ULTIMATE.start_main_~#t1212~0.base_25|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_~#t1211~0.offset=|v_ULTIMATE.start_main_~#t1211~0.offset_19|, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y~0=v_~y~0_26, ULTIMATE.start_main_~#t1212~0.offset=|v_ULTIMATE.start_main_~#t1212~0.offset_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_80, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1213~0.base, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1213~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1211~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1212~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1211~0.offset, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1212~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #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, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:36:15,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-1-->L812: Formula: (and (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1212~0.base_13|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1212~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1212~0.base_13|) |v_ULTIMATE.start_main_~#t1212~0.offset_11| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t1212~0.base_13| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1212~0.base_13|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1212~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1212~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1212~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1212~0.offset=|v_ULTIMATE.start_main_~#t1212~0.offset_11|, ULTIMATE.start_main_~#t1212~0.base=|v_ULTIMATE.start_main_~#t1212~0.base_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1212~0.offset, ULTIMATE.start_main_~#t1212~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 06:36:15,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L812-1-->L814: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1213~0.base_13| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1213~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1213~0.base_13|) |v_ULTIMATE.start_main_~#t1213~0.offset_11| 2)) |v_#memory_int_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1213~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1213~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1213~0.base_13| 0)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1213~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1213~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1213~0.base=|v_ULTIMATE.start_main_~#t1213~0.base_13|, ULTIMATE.start_main_~#t1213~0.offset=|v_ULTIMATE.start_main_~#t1213~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1213~0.base, ULTIMATE.start_main_~#t1213~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 06:36:15,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= 0 (mod v_~y$w_buff1_used~0_47 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6) (= 1 v_~y$w_buff0_used~0_77) (= 2 v_~y$w_buff0~0_14) (= v_P2Thread1of1ForFork0_~arg.offset_4 |v_P2Thread1of1ForFork0_#in~arg.offset_4|) (= v_P2Thread1of1ForFork0_~arg.base_4 |v_P2Thread1of1ForFork0_#in~arg.base_4|) (= v_~y$w_buff1_used~0_47 v_~y$w_buff0_used~0_78) (= v_~y$w_buff0~0_15 v_~y$w_buff1~0_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_4, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_14, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:36:15,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] P0ENTRY-->P0EXIT: Formula: (and (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_9, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 06:36:15,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In394485828 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In394485828 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_Out394485828| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite11_Out394485828| ~y$w_buff0_used~0_In394485828) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In394485828, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In394485828} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In394485828, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out394485828|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In394485828} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 06:36:15,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-283491662 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-283491662 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-283491662 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-283491662 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite12_Out-283491662| 0)) (and (= |P2Thread1of1ForFork0_#t~ite12_Out-283491662| ~y$w_buff1_used~0_In-283491662) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-283491662, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-283491662, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-283491662, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-283491662} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-283491662, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-283491662, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-283491662|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-283491662, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-283491662} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 06:36:15,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1740821713 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1740821713 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out1740821713 0)) (and (= ~y$r_buff0_thd3~0_Out1740821713 ~y$r_buff0_thd3~0_In1740821713) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1740821713, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1740821713} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1740821713, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1740821713, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out1740821713|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 06:36:15,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-2002630720 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-2002630720 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-2002630720 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2002630720 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out-2002630720| 0)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-2002630720 |P2Thread1of1ForFork0_#t~ite14_Out-2002630720|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2002630720, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2002630720, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2002630720, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2002630720} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-2002630720|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2002630720, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2002630720, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2002630720, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2002630720} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 06:36:15,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork0_#t~ite14_8|)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:36:15,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In2072394625 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In2072394625 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite3_Out2072394625| ~y$w_buff1~0_In2072394625) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite3_Out2072394625| ~y~0_In2072394625) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2072394625, ~y$w_buff1~0=~y$w_buff1~0_In2072394625, ~y~0=~y~0_In2072394625, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2072394625} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2072394625, ~y$w_buff1~0=~y$w_buff1~0_In2072394625, ~y~0=~y~0_In2072394625, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out2072394625|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2072394625} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:36:15,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_7|, ~y~0=v_~y~0_18, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:36:15,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-20815847 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-20815847 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite5_Out-20815847| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite5_Out-20815847| ~y$w_buff0_used~0_In-20815847)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-20815847, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-20815847} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-20815847, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-20815847, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-20815847|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:36:15,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In276248816 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In276248816 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In276248816 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In276248816 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out276248816| ~y$w_buff1_used~0_In276248816) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite6_Out276248816| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In276248816, ~y$w_buff0_used~0=~y$w_buff0_used~0_In276248816, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In276248816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In276248816} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In276248816, ~y$w_buff0_used~0=~y$w_buff0_used~0_In276248816, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In276248816, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out276248816|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In276248816} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:36:15,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2004713271 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2004713271 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out-2004713271|)) (and (= ~y$r_buff0_thd2~0_In-2004713271 |P1Thread1of1ForFork2_#t~ite7_Out-2004713271|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004713271, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2004713271} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004713271, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2004713271, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-2004713271|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:36:15,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1682944807 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1682944807 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1682944807 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1682944807 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out1682944807|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In1682944807 |P1Thread1of1ForFork2_#t~ite8_Out1682944807|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1682944807, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1682944807, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1682944807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1682944807} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1682944807, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1682944807, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1682944807|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1682944807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1682944807} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:36:15,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:36:15,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:36:15,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-755176662 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-755176662 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out-755176662| |ULTIMATE.start_main_#t~ite19_Out-755176662|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite18_Out-755176662| ~y~0_In-755176662) .cse2) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In-755176662 |ULTIMATE.start_main_#t~ite18_Out-755176662|) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-755176662, ~y~0=~y~0_In-755176662, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-755176662, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-755176662} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-755176662, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-755176662|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-755176662|, ~y~0=~y~0_In-755176662, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-755176662, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-755176662} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:36:15,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1558477640 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1558477640 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite20_Out-1558477640| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out-1558477640| ~y$w_buff0_used~0_In-1558477640) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1558477640, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1558477640} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1558477640, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1558477640, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1558477640|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:36:15,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-36103993 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-36103993 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-36103993 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-36103993 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-36103993| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite21_Out-36103993| ~y$w_buff1_used~0_In-36103993) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-36103993, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-36103993, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-36103993, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-36103993} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-36103993, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-36103993, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-36103993|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-36103993, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-36103993} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:36:15,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-760269232 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-760269232 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-760269232| ~y$r_buff0_thd0~0_In-760269232) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite22_Out-760269232|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-760269232, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-760269232} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-760269232, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-760269232, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-760269232|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:36:15,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1571536244 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1571536244 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1571536244 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1571536244 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In1571536244 |ULTIMATE.start_main_#t~ite23_Out1571536244|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out1571536244| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1571536244, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1571536244, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1571536244, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1571536244} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1571536244, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1571536244, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1571536244, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1571536244|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1571536244} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:36:15,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L833-->L833-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In3469198 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite32_In3469198| |ULTIMATE.start_main_#t~ite32_Out3469198|) (= |ULTIMATE.start_main_#t~ite33_Out3469198| ~y$w_buff1~0_In3469198) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In3469198 256) 0))) (or (= (mod ~y$w_buff0_used~0_In3469198 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In3469198 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In3469198 256) 0)))) .cse0 (= |ULTIMATE.start_main_#t~ite32_Out3469198| |ULTIMATE.start_main_#t~ite33_Out3469198|) (= |ULTIMATE.start_main_#t~ite32_Out3469198| ~y$w_buff1~0_In3469198)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In3469198, ~y$w_buff0_used~0=~y$w_buff0_used~0_In3469198, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In3469198, ~weak$$choice2~0=~weak$$choice2~0_In3469198, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In3469198, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In3469198|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In3469198} OutVars{~y$w_buff1~0=~y$w_buff1~0_In3469198, ~y$w_buff0_used~0=~y$w_buff0_used~0_In3469198, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In3469198, ~weak$$choice2~0=~weak$$choice2~0_In3469198, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out3469198|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In3469198, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out3469198|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In3469198} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-27 06:36:15,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L834-->L834-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1685637533 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out-1685637533| ~y$w_buff0_used~0_In-1685637533) .cse0 (= |ULTIMATE.start_main_#t~ite36_Out-1685637533| |ULTIMATE.start_main_#t~ite35_Out-1685637533|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1685637533 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-1685637533 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-1685637533 256) 0)) (= (mod ~y$w_buff0_used~0_In-1685637533 256) 0)))) (and (= |ULTIMATE.start_main_#t~ite35_In-1685637533| |ULTIMATE.start_main_#t~ite35_Out-1685637533|) (= |ULTIMATE.start_main_#t~ite36_Out-1685637533| ~y$w_buff0_used~0_In-1685637533) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1685637533, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1685637533, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-1685637533|, ~weak$$choice2~0=~weak$$choice2~0_In-1685637533, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1685637533, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1685637533} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1685637533, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1685637533, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1685637533|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1685637533|, ~weak$$choice2~0=~weak$$choice2~0_In-1685637533, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1685637533, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1685637533} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 06:36:15,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L835-->L835-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-160813072 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-160813072| ~y$w_buff1_used~0_In-160813072) (= |ULTIMATE.start_main_#t~ite38_Out-160813072| |ULTIMATE.start_main_#t~ite39_Out-160813072|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-160813072 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-160813072 256) 0)) (= (mod ~y$w_buff0_used~0_In-160813072 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-160813072 256)) .cse1)))) (and (= |ULTIMATE.start_main_#t~ite38_In-160813072| |ULTIMATE.start_main_#t~ite38_Out-160813072|) (= |ULTIMATE.start_main_#t~ite39_Out-160813072| ~y$w_buff1_used~0_In-160813072) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-160813072, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-160813072, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-160813072|, ~weak$$choice2~0=~weak$$choice2~0_In-160813072, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-160813072, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-160813072} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-160813072, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-160813072|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-160813072, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-160813072|, ~weak$$choice2~0=~weak$$choice2~0_In-160813072, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-160813072, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-160813072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:36:15,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd0~0_64 v_~y$r_buff0_thd0~0_63)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:36:15,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L839-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_23 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:36:15,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:36:15,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:36:15 BasicIcfg [2019-12-27 06:36:15,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:36:15,398 INFO L168 Benchmark]: Toolchain (without parser) took 18743.45 ms. Allocated memory was 135.3 MB in the beginning and 888.1 MB in the end (delta: 752.9 MB). Free memory was 98.2 MB in the beginning and 589.5 MB in the end (delta: -491.4 MB). Peak memory consumption was 654.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:36:15,398 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 135.3 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 06:36:15,399 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.15 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 97.7 MB in the beginning and 153.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:36:15,400 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.53 ms. Allocated memory is still 199.2 MB. Free memory was 153.1 MB in the beginning and 149.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:36:15,401 INFO L168 Benchmark]: Boogie Preprocessor took 49.59 ms. Allocated memory is still 199.2 MB. Free memory was 149.5 MB in the beginning and 147.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:36:15,405 INFO L168 Benchmark]: RCFGBuilder took 846.00 ms. Allocated memory is still 199.2 MB. Free memory was 147.4 MB in the beginning and 100.3 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:36:15,407 INFO L168 Benchmark]: TraceAbstraction took 16961.05 ms. Allocated memory was 199.2 MB in the beginning and 888.1 MB in the end (delta: 688.9 MB). Free memory was 100.3 MB in the beginning and 589.5 MB in the end (delta: -489.3 MB). Peak memory consumption was 592.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:36:15,415 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.19 ms. Allocated memory is still 135.3 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 808.15 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 97.7 MB in the beginning and 153.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.53 ms. Allocated memory is still 199.2 MB. Free memory was 153.1 MB in the beginning and 149.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.59 ms. Allocated memory is still 199.2 MB. Free memory was 149.5 MB in the beginning and 147.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 846.00 ms. Allocated memory is still 199.2 MB. Free memory was 147.4 MB in the beginning and 100.3 MB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16961.05 ms. Allocated memory was 199.2 MB in the beginning and 888.1 MB in the end (delta: 688.9 MB). Free memory was 100.3 MB in the beginning and 589.5 MB in the end (delta: -489.3 MB). Peak memory consumption was 592.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 164 ProgramPointsBefore, 84 ProgramPointsAfterwards, 195 TransitionsBefore, 93 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4106 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48939 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1211, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t1212, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1213, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L752] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L832] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L833] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L834] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L835] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1283 SDtfs, 1378 SDslu, 2893 SDs, 0 SdLazy, 2154 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24300occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 3240 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 507 ConstructedInterpolants, 0 QuantifiedInterpolants, 108209 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...