/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:04:29,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:04:29,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:04:29,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:04:29,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:04:29,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:04:29,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:04:29,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:04:29,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:04:29,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:04:29,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:04:29,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:04:29,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:04:29,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:04:29,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:04:29,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:04:29,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:04:29,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:04:29,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:04:29,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:04:29,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:04:29,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:04:29,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:04:29,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:04:29,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:04:29,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:04:29,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:04:29,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:04:29,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:04:29,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:04:29,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:04:29,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:04:29,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:04:29,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:04:29,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:04:29,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:04:29,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:04:29,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:04:29,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:04:29,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:04:29,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:04:29,107 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:04:29,133 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:04:29,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:04:29,135 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:04:29,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:04:29,136 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:04:29,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:04:29,136 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:04:29,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:04:29,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:04:29,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:04:29,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:04:29,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:04:29,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:04:29,138 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:04:29,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:04:29,139 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:04:29,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:04:29,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:04:29,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:04:29,140 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:04:29,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:04:29,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:04:29,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:04:29,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:04:29,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:04:29,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:04:29,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:04:29,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:04:29,142 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:04:29,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:04:29,448 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:04:29,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:04:29,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:04:29,475 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:04:29,476 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:04:29,477 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2019-12-26 23:04:29,548 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e7dd2658/16da291aeddc4d75acdf89de4ba58c9d/FLAG70ac1b7bd [2019-12-26 23:04:30,110 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:04:30,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2019-12-26 23:04:30,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e7dd2658/16da291aeddc4d75acdf89de4ba58c9d/FLAG70ac1b7bd [2019-12-26 23:04:30,437 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e7dd2658/16da291aeddc4d75acdf89de4ba58c9d [2019-12-26 23:04:30,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:04:30,448 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:04:30,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:04:30,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:04:30,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:04:30,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:04:30" (1/1) ... [2019-12-26 23:04:30,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f84663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:04:30, skipping insertion in model container [2019-12-26 23:04:30,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:04:30" (1/1) ... [2019-12-26 23:04:30,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:04:30,536 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:04:31,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:04:31,058 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:04:31,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:04:31,194 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:04:31,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:04:31 WrapperNode [2019-12-26 23:04:31,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:04:31,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:04:31,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:04:31,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:04:31,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:04:31" (1/1) ... [2019-12-26 23:04:31,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:04:31" (1/1) ... [2019-12-26 23:04:31,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:04:31,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:04:31,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:04:31,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:04:31,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:04:31" (1/1) ... [2019-12-26 23:04:31,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:04:31" (1/1) ... [2019-12-26 23:04:31,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:04:31" (1/1) ... [2019-12-26 23:04:31,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:04:31" (1/1) ... [2019-12-26 23:04:31,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:04:31" (1/1) ... [2019-12-26 23:04:31,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:04:31" (1/1) ... [2019-12-26 23:04:31,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:04:31" (1/1) ... [2019-12-26 23:04:31,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:04:31,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:04:31,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:04:31,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:04:31,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:04:31" (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-26 23:04:31,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:04:31,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:04:31,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:04:31,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:04:31,394 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:04:31,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:04:31,394 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:04:31,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:04:31,395 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:04:31,395 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:04:31,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:04:31,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:04:31,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:04:31,397 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:04:32,106 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:04:32,106 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:04:32,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:04:32 BoogieIcfgContainer [2019-12-26 23:04:32,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:04:32,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:04:32,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:04:32,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:04:32,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:04:30" (1/3) ... [2019-12-26 23:04:32,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382970b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:04:32, skipping insertion in model container [2019-12-26 23:04:32,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:04:31" (2/3) ... [2019-12-26 23:04:32,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382970b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:04:32, skipping insertion in model container [2019-12-26 23:04:32,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:04:32" (3/3) ... [2019-12-26 23:04:32,117 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_tso.oepc.i [2019-12-26 23:04:32,128 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:04:32,128 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:04:32,136 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:04:32,137 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:04:32,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,175 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,175 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,177 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,178 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,186 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,186 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,187 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,187 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,188 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,198 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,200 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,200 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,207 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,208 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:04:32,241 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:04:32,260 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:04:32,260 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:04:32,260 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:04:32,260 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:04:32,260 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:04:32,260 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:04:32,261 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:04:32,261 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:04:32,278 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-26 23:04:32,281 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-26 23:04:32,370 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-26 23:04:32,370 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:04:32,385 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:04:32,405 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-26 23:04:32,452 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-26 23:04:32,453 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:04:32,458 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:04:32,472 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-26 23:04:32,473 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:04:37,026 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-26 23:04:37,151 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-26 23:04:37,169 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48383 [2019-12-26 23:04:37,169 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-26 23:04:37,172 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-26 23:04:38,154 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16526 states. [2019-12-26 23:04:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states. [2019-12-26 23:04:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 23:04:38,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:38,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:38,162 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-26 23:04:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:38,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2128093424, now seen corresponding path program 1 times [2019-12-26 23:04:38,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:38,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096546677] [2019-12-26 23:04:38,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:38,520 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-26 23:04:38,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096546677] [2019-12-26 23:04:38,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:38,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:04:38,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5919438] [2019-12-26 23:04:38,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:04:38,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:38,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:04:38,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:38,548 INFO L87 Difference]: Start difference. First operand 16526 states. Second operand 3 states. [2019-12-26 23:04:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:38,963 INFO L93 Difference]: Finished difference Result 16398 states and 61580 transitions. [2019-12-26 23:04:38,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:04:38,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 23:04:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:39,131 INFO L225 Difference]: With dead ends: 16398 [2019-12-26 23:04:39,132 INFO L226 Difference]: Without dead ends: 16062 [2019-12-26 23:04:39,133 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-26 23:04:39,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16062 states. [2019-12-26 23:04:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16062 to 16062. [2019-12-26 23:04:40,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16062 states. [2019-12-26 23:04:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 60376 transitions. [2019-12-26 23:04:40,440 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 60376 transitions. Word has length 7 [2019-12-26 23:04:40,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:40,441 INFO L462 AbstractCegarLoop]: Abstraction has 16062 states and 60376 transitions. [2019-12-26 23:04:40,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:04:40,441 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 60376 transitions. [2019-12-26 23:04:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:04:40,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:40,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:40,446 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-26 23:04:40,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:40,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1390331573, now seen corresponding path program 1 times [2019-12-26 23:04:40,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:40,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65855283] [2019-12-26 23:04:40,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:40,532 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-26 23:04:40,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65855283] [2019-12-26 23:04:40,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:40,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:04:40,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745391055] [2019-12-26 23:04:40,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:04:40,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:40,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:04:40,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:04:40,537 INFO L87 Difference]: Start difference. First operand 16062 states and 60376 transitions. Second operand 4 states. [2019-12-26 23:04:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:41,419 INFO L93 Difference]: Finished difference Result 24942 states and 90524 transitions. [2019-12-26 23:04:41,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:04:41,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:04:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:41,541 INFO L225 Difference]: With dead ends: 24942 [2019-12-26 23:04:41,541 INFO L226 Difference]: Without dead ends: 24928 [2019-12-26 23:04:41,542 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-26 23:04:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24928 states. [2019-12-26 23:04:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24928 to 22166. [2019-12-26 23:04:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22166 states. [2019-12-26 23:04:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22166 states to 22166 states and 81470 transitions. [2019-12-26 23:04:42,478 INFO L78 Accepts]: Start accepts. Automaton has 22166 states and 81470 transitions. Word has length 13 [2019-12-26 23:04:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:42,479 INFO L462 AbstractCegarLoop]: Abstraction has 22166 states and 81470 transitions. [2019-12-26 23:04:42,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:04:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 22166 states and 81470 transitions. [2019-12-26 23:04:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:04:42,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:42,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:42,483 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-26 23:04:42,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:42,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1371832765, now seen corresponding path program 1 times [2019-12-26 23:04:42,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:42,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38572551] [2019-12-26 23:04:42,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:42,539 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-26 23:04:42,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38572551] [2019-12-26 23:04:42,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:42,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:04:42,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450538026] [2019-12-26 23:04:42,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:04:42,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:42,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:04:42,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:42,542 INFO L87 Difference]: Start difference. First operand 22166 states and 81470 transitions. Second operand 3 states. [2019-12-26 23:04:42,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:42,602 INFO L93 Difference]: Finished difference Result 12675 states and 40338 transitions. [2019-12-26 23:04:42,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:04:42,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:04:42,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:42,649 INFO L225 Difference]: With dead ends: 12675 [2019-12-26 23:04:42,649 INFO L226 Difference]: Without dead ends: 12675 [2019-12-26 23:04:42,650 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-26 23:04:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12675 states. [2019-12-26 23:04:42,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12675 to 12675. [2019-12-26 23:04:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12675 states. [2019-12-26 23:04:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12675 states to 12675 states and 40338 transitions. [2019-12-26 23:04:42,992 INFO L78 Accepts]: Start accepts. Automaton has 12675 states and 40338 transitions. Word has length 13 [2019-12-26 23:04:42,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:42,993 INFO L462 AbstractCegarLoop]: Abstraction has 12675 states and 40338 transitions. [2019-12-26 23:04:42,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:04:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 12675 states and 40338 transitions. [2019-12-26 23:04:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:04:42,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:42,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:04:42,995 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-26 23:04:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:42,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1884008947, now seen corresponding path program 1 times [2019-12-26 23:04:42,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:42,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868322921] [2019-12-26 23:04:43,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:43,926 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-26 23:04:43,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868322921] [2019-12-26 23:04:43,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:43,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:04:43,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374891467] [2019-12-26 23:04:43,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:04:43,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:04:43,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:04:43,929 INFO L87 Difference]: Start difference. First operand 12675 states and 40338 transitions. Second operand 4 states. [2019-12-26 23:04:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:43,954 INFO L93 Difference]: Finished difference Result 1939 states and 4540 transitions. [2019-12-26 23:04:43,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:04:43,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:04:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:43,960 INFO L225 Difference]: With dead ends: 1939 [2019-12-26 23:04:43,961 INFO L226 Difference]: Without dead ends: 1939 [2019-12-26 23:04:43,961 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-26 23:04:43,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-26 23:04:43,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2019-12-26 23:04:43,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-26 23:04:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4540 transitions. [2019-12-26 23:04:43,996 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4540 transitions. Word has length 14 [2019-12-26 23:04:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:43,996 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4540 transitions. [2019-12-26 23:04:43,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:04:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4540 transitions. [2019-12-26 23:04:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 23:04:43,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:43,999 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-26 23:04:43,999 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-26 23:04:43,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:44,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1748149180, now seen corresponding path program 1 times [2019-12-26 23:04:44,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:44,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313987936] [2019-12-26 23:04:44,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:44,064 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-26 23:04:44,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313987936] [2019-12-26 23:04:44,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:44,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:04:44,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64466887] [2019-12-26 23:04:44,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:04:44,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:44,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:04:44,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:04:44,067 INFO L87 Difference]: Start difference. First operand 1939 states and 4540 transitions. Second operand 5 states. [2019-12-26 23:04:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:44,095 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-26 23:04:44,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:04:44,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 23:04:44,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:44,097 INFO L225 Difference]: With dead ends: 653 [2019-12-26 23:04:44,097 INFO L226 Difference]: Without dead ends: 653 [2019-12-26 23:04:44,097 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-26 23:04:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-26 23:04:44,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-26 23:04:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-26 23:04:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-26 23:04:44,108 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-26 23:04:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:44,109 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-26 23:04:44,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:04:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-26 23:04:44,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:04:44,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:44,114 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-26 23:04:44,114 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-26 23:04:44,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:44,114 INFO L82 PathProgramCache]: Analyzing trace with hash 306322931, now seen corresponding path program 1 times [2019-12-26 23:04:44,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:44,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018764942] [2019-12-26 23:04:44,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:44,269 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-26 23:04:44,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018764942] [2019-12-26 23:04:44,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:44,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:04:44,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820831041] [2019-12-26 23:04:44,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:04:44,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:44,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:04:44,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:44,272 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-26 23:04:44,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:44,322 INFO L93 Difference]: Finished difference Result 607 states and 1414 transitions. [2019-12-26 23:04:44,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:04:44,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 23:04:44,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:44,325 INFO L225 Difference]: With dead ends: 607 [2019-12-26 23:04:44,326 INFO L226 Difference]: Without dead ends: 607 [2019-12-26 23:04:44,326 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-26 23:04:44,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-26 23:04:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2019-12-26 23:04:44,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-12-26 23:04:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1410 transitions. [2019-12-26 23:04:44,336 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1410 transitions. Word has length 55 [2019-12-26 23:04:44,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:44,337 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1410 transitions. [2019-12-26 23:04:44,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:04:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1410 transitions. [2019-12-26 23:04:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:04:44,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:44,339 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-26 23:04:44,339 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-26 23:04:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:44,340 INFO L82 PathProgramCache]: Analyzing trace with hash -826083081, now seen corresponding path program 1 times [2019-12-26 23:04:44,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:44,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832654175] [2019-12-26 23:04:44,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:44,500 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-26 23:04:44,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832654175] [2019-12-26 23:04:44,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:44,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:04:44,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709495848] [2019-12-26 23:04:44,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:04:44,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:44,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:04:44,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:44,508 INFO L87 Difference]: Start difference. First operand 603 states and 1410 transitions. Second operand 3 states. [2019-12-26 23:04:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:44,525 INFO L93 Difference]: Finished difference Result 579 states and 1326 transitions. [2019-12-26 23:04:44,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:04:44,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 23:04:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:44,527 INFO L225 Difference]: With dead ends: 579 [2019-12-26 23:04:44,527 INFO L226 Difference]: Without dead ends: 579 [2019-12-26 23:04:44,528 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-26 23:04:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-12-26 23:04:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-12-26 23:04:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-12-26 23:04:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1326 transitions. [2019-12-26 23:04:44,541 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1326 transitions. Word has length 55 [2019-12-26 23:04:44,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:44,543 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 1326 transitions. [2019-12-26 23:04:44,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:04:44,544 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1326 transitions. [2019-12-26 23:04:44,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:04:44,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:44,545 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-26 23:04:44,546 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-26 23:04:44,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:44,546 INFO L82 PathProgramCache]: Analyzing trace with hash -438818646, now seen corresponding path program 1 times [2019-12-26 23:04:44,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:44,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214580918] [2019-12-26 23:04:44,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:44,650 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-26 23:04:44,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214580918] [2019-12-26 23:04:44,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:44,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:04:44,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395655800] [2019-12-26 23:04:44,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:04:44,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:44,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:04:44,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:04:44,652 INFO L87 Difference]: Start difference. First operand 579 states and 1326 transitions. Second operand 5 states. [2019-12-26 23:04:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:44,847 INFO L93 Difference]: Finished difference Result 850 states and 1949 transitions. [2019-12-26 23:04:44,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:04:44,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-26 23:04:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:44,850 INFO L225 Difference]: With dead ends: 850 [2019-12-26 23:04:44,850 INFO L226 Difference]: Without dead ends: 850 [2019-12-26 23:04:44,850 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-26 23:04:44,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-12-26 23:04:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 663. [2019-12-26 23:04:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-12-26 23:04:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1530 transitions. [2019-12-26 23:04:44,862 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1530 transitions. Word has length 56 [2019-12-26 23:04:44,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:44,863 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 1530 transitions. [2019-12-26 23:04:44,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:04:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1530 transitions. [2019-12-26 23:04:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:04:44,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:44,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-26 23:04:44,865 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-26 23:04:44,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:44,866 INFO L82 PathProgramCache]: Analyzing trace with hash 684538364, now seen corresponding path program 2 times [2019-12-26 23:04:44,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:44,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289964944] [2019-12-26 23:04:44,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:44,966 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-26 23:04:44,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289964944] [2019-12-26 23:04:44,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:44,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:04:44,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293297439] [2019-12-26 23:04:44,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:04:44,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:44,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:04:44,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:04:44,969 INFO L87 Difference]: Start difference. First operand 663 states and 1530 transitions. Second operand 3 states. [2019-12-26 23:04:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:45,013 INFO L93 Difference]: Finished difference Result 662 states and 1528 transitions. [2019-12-26 23:04:45,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:04:45,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-26 23:04:45,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:45,015 INFO L225 Difference]: With dead ends: 662 [2019-12-26 23:04:45,016 INFO L226 Difference]: Without dead ends: 662 [2019-12-26 23:04:45,016 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-26 23:04:45,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-12-26 23:04:45,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 473. [2019-12-26 23:04:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-12-26 23:04:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1090 transitions. [2019-12-26 23:04:45,025 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1090 transitions. Word has length 56 [2019-12-26 23:04:45,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:45,025 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 1090 transitions. [2019-12-26 23:04:45,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:04:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1090 transitions. [2019-12-26 23:04:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 23:04:45,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:45,027 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-26 23:04:45,028 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-26 23:04:45,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:45,028 INFO L82 PathProgramCache]: Analyzing trace with hash 816342703, now seen corresponding path program 1 times [2019-12-26 23:04:45,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:45,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544080001] [2019-12-26 23:04:45,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:45,359 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-26 23:04:45,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544080001] [2019-12-26 23:04:45,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:45,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:04:45,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997171929] [2019-12-26 23:04:45,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:04:45,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:45,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:04:45,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:04:45,364 INFO L87 Difference]: Start difference. First operand 473 states and 1090 transitions. Second operand 12 states. [2019-12-26 23:04:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:46,007 INFO L93 Difference]: Finished difference Result 1088 states and 2214 transitions. [2019-12-26 23:04:46,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:04:46,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-26 23:04:46,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:46,010 INFO L225 Difference]: With dead ends: 1088 [2019-12-26 23:04:46,010 INFO L226 Difference]: Without dead ends: 578 [2019-12-26 23:04:46,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-26 23:04:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-12-26 23:04:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 411. [2019-12-26 23:04:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-26 23:04:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 911 transitions. [2019-12-26 23:04:46,017 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 911 transitions. Word has length 57 [2019-12-26 23:04:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:46,017 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 911 transitions. [2019-12-26 23:04:46,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:04:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 911 transitions. [2019-12-26 23:04:46,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 23:04:46,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:46,019 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-26 23:04:46,019 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-26 23:04:46,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:46,020 INFO L82 PathProgramCache]: Analyzing trace with hash 729563135, now seen corresponding path program 2 times [2019-12-26 23:04:46,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:46,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932622530] [2019-12-26 23:04:46,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:46,128 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-26 23:04:46,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932622530] [2019-12-26 23:04:46,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:46,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:04:46,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241276] [2019-12-26 23:04:46,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:04:46,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:46,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:04:46,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:04:46,130 INFO L87 Difference]: Start difference. First operand 411 states and 911 transitions. Second operand 6 states. [2019-12-26 23:04:46,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:46,194 INFO L93 Difference]: Finished difference Result 644 states and 1366 transitions. [2019-12-26 23:04:46,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:04:46,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-26 23:04:46,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:46,195 INFO L225 Difference]: With dead ends: 644 [2019-12-26 23:04:46,196 INFO L226 Difference]: Without dead ends: 231 [2019-12-26 23:04:46,196 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-26 23:04:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-12-26 23:04:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 207. [2019-12-26 23:04:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-26 23:04:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 364 transitions. [2019-12-26 23:04:46,200 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 364 transitions. Word has length 57 [2019-12-26 23:04:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:46,201 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 364 transitions. [2019-12-26 23:04:46,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:04:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 364 transitions. [2019-12-26 23:04:46,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 23:04:46,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:46,202 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-26 23:04:46,202 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-26 23:04:46,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:46,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1516556909, now seen corresponding path program 3 times [2019-12-26 23:04:46,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:46,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280081409] [2019-12-26 23:04:46,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:46,420 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-26 23:04:46,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280081409] [2019-12-26 23:04:46,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:46,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:04:46,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827784705] [2019-12-26 23:04:46,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:04:46,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:46,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:04:46,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:04:46,424 INFO L87 Difference]: Start difference. First operand 207 states and 364 transitions. Second operand 12 states. [2019-12-26 23:04:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:47,060 INFO L93 Difference]: Finished difference Result 371 states and 637 transitions. [2019-12-26 23:04:47,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 23:04:47,061 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-26 23:04:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:47,062 INFO L225 Difference]: With dead ends: 371 [2019-12-26 23:04:47,062 INFO L226 Difference]: Without dead ends: 341 [2019-12-26 23:04:47,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-26 23:04:47,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-12-26 23:04:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 307. [2019-12-26 23:04:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-26 23:04:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-12-26 23:04:47,067 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 57 [2019-12-26 23:04:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:47,067 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-12-26 23:04:47,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:04:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-12-26 23:04:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 23:04:47,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:47,069 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-26 23:04:47,069 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-26 23:04:47,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:47,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1834190715, now seen corresponding path program 4 times [2019-12-26 23:04:47,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:47,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425929470] [2019-12-26 23:04:47,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:47,471 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-26 23:04:47,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425929470] [2019-12-26 23:04:47,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:47,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 23:04:47,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717372226] [2019-12-26 23:04:47,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 23:04:47,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:47,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 23:04:47,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:04:47,474 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 18 states. [2019-12-26 23:04:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:48,768 INFO L93 Difference]: Finished difference Result 590 states and 1013 transitions. [2019-12-26 23:04:48,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 23:04:48,769 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-12-26 23:04:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:48,770 INFO L225 Difference]: With dead ends: 590 [2019-12-26 23:04:48,770 INFO L226 Difference]: Without dead ends: 560 [2019-12-26 23:04:48,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 23:04:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-12-26 23:04:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 329. [2019-12-26 23:04:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-26 23:04:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 577 transitions. [2019-12-26 23:04:48,778 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 577 transitions. Word has length 57 [2019-12-26 23:04:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:48,778 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 577 transitions. [2019-12-26 23:04:48,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 23:04:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 577 transitions. [2019-12-26 23:04:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 23:04:48,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:48,779 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-26 23:04:48,779 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-26 23:04:48,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:48,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1124170117, now seen corresponding path program 5 times [2019-12-26 23:04:48,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:48,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76304673] [2019-12-26 23:04:48,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:04:49,241 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-26 23:04:49,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76304673] [2019-12-26 23:04:49,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:04:49,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 23:04:49,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668467503] [2019-12-26 23:04:49,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 23:04:49,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:04:49,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 23:04:49,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:04:49,243 INFO L87 Difference]: Start difference. First operand 329 states and 577 transitions. Second operand 18 states. [2019-12-26 23:04:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:04:50,492 INFO L93 Difference]: Finished difference Result 740 states and 1266 transitions. [2019-12-26 23:04:50,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 23:04:50,493 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-12-26 23:04:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:04:50,495 INFO L225 Difference]: With dead ends: 740 [2019-12-26 23:04:50,496 INFO L226 Difference]: Without dead ends: 710 [2019-12-26 23:04:50,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=838, Unknown=0, NotChecked=0, Total=992 [2019-12-26 23:04:50,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-12-26 23:04:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 341. [2019-12-26 23:04:50,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-26 23:04:50,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 599 transitions. [2019-12-26 23:04:50,504 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 599 transitions. Word has length 57 [2019-12-26 23:04:50,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:04:50,504 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 599 transitions. [2019-12-26 23:04:50,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 23:04:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 599 transitions. [2019-12-26 23:04:50,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 23:04:50,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:04:50,505 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-26 23:04:50,506 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:04:50,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:04:50,506 INFO L82 PathProgramCache]: Analyzing trace with hash 731376245, now seen corresponding path program 6 times [2019-12-26 23:04:50,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:04:50,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287068466] [2019-12-26 23:04:50,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:04:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:04:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:04:50,618 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:04:50,618 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:04:50,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1507~0.base_26|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1507~0.base_26|)) (= 0 v_~weak$$choice0~0_25) (= 0 v_~y$r_buff0_thd3~0_151) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1507~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1507~0.base_26|) |v_ULTIMATE.start_main_~#t1507~0.offset_19| 0)) |v_#memory_int_23|) (= v_~y$w_buff1~0_200 0) (= v_~y$w_buff0_used~0_650 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1507~0.base_26| 4)) (= v_~__unbuffered_cnt~0_109 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$w_buff0~0_308) (= 0 v_~y$r_buff1_thd3~0_122) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd1~0_76) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1507~0.base_26| 1)) (= v_~z~0_51 0) (= v_~y$r_buff0_thd1~0_29 0) (= v_~main$tmp_guard1~0_28 0) (= v_~y$r_buff0_thd0~0_312 0) (= 0 v_~__unbuffered_p2_EAX~0_90) (= 0 v_~y$flush_delayed~0_45) (= v_~y$w_buff1_used~0_407 0) (= 0 |v_ULTIMATE.start_main_~#t1507~0.offset_19|) (= v_~y$r_buff0_thd2~0_88 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff1_thd2~0_131) (= v_~y$mem_tmp~0_31 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= v_~weak$$choice2~0_131 0) (= v_~y$r_buff1_thd0~0_254 0) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_26|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_104|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_52|, ULTIMATE.start_main_~#t1507~0.base=|v_ULTIMATE.start_main_~#t1507~0.base_26|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_122, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_34|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_142|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_98|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_27|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_25, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ULTIMATE.start_main_~#t1507~0.offset=|v_ULTIMATE.start_main_~#t1507~0.offset_19|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1508~0.base=|v_ULTIMATE.start_main_~#t1508~0.base_26|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_88, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ~x~0=v_~x~0_80, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_650, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_31|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_32|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_58|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_76, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ~y$w_buff0~0=v_~y$w_buff0~0_308, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ULTIMATE.start_main_~#t1508~0.offset=|v_ULTIMATE.start_main_~#t1508~0.offset_19|, ~y~0=v_~y~0_150, ULTIMATE.start_main_~#t1509~0.base=|v_ULTIMATE.start_main_~#t1509~0.base_21|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_44|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_96|, ULTIMATE.start_main_~#t1509~0.offset=|v_ULTIMATE.start_main_~#t1509~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_31|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_131, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[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_~#t1507~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1507~0.offset, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1508~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_#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, ULTIMATE.start_main_~#t1508~0.offset, ~y~0, ULTIMATE.start_main_~#t1509~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1509~0.offset, ~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-26 23:04:50,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L800-1-->L802: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1508~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1508~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1508~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1508~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1508~0.base_13|) |v_ULTIMATE.start_main_~#t1508~0.offset_11| 1)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1508~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t1508~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1508~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1508~0.base=|v_ULTIMATE.start_main_~#t1508~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1508~0.offset=|v_ULTIMATE.start_main_~#t1508~0.offset_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1508~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1508~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-26 23:04:50,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L802-1-->L804: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1509~0.base_12| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1509~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1509~0.base_12|) |v_ULTIMATE.start_main_~#t1509~0.offset_10| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1509~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1509~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1509~0.base_12| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1509~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t1509~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1509~0.offset=|v_ULTIMATE.start_main_~#t1509~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1509~0.base=|v_ULTIMATE.start_main_~#t1509~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1509~0.offset, #length, ULTIMATE.start_main_~#t1509~0.base] because there is no mapped edge [2019-12-26 23:04:50,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_40) (= v_~y$w_buff0_used~0_161 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_32) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P2Thread1of1ForFork0_~arg.base_8 |v_P2Thread1of1ForFork0_#in~arg.base_8|) (= (mod v_~y$w_buff1_used~0_89 256) 0) (= v_P2Thread1of1ForFork0_~arg.offset_8 |v_P2Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_89 v_~y$w_buff0_used~0_162)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_8, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_8, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} 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-26 23:04:50,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_35 1) (= |v_P0Thread1of1ForFork1_#res.base_11| 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_11|) (= v_~x~0_49 1) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_11|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_11|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~z~0=v_~z~0_35, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_49, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 23:04:50,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1808404177 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1808404177 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out1808404177|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1808404177 |P2Thread1of1ForFork0_#t~ite11_Out1808404177|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1808404177, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1808404177} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1808404177, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1808404177|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1808404177} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-26 23:04:50,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1993946788 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1993946788 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out-1993946788| ~y$w_buff1~0_In-1993946788) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-1993946788| ~y~0_In-1993946788)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1993946788, ~y$w_buff1~0=~y$w_buff1~0_In-1993946788, ~y~0=~y~0_In-1993946788, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1993946788} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1993946788, ~y$w_buff1~0=~y$w_buff1~0_In-1993946788, ~y~0=~y~0_In-1993946788, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1993946788|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1993946788} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-26 23:04:50,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= |v_P1Thread1of1ForFork2_#t~ite3_12| v_~y~0_21) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_12|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_13|, ~y~0=v_~y~0_21, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-26 23:04:50,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1758748042 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1758748042 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite5_Out-1758748042| ~y$w_buff0_used~0_In-1758748042)) (and (= |P1Thread1of1ForFork2_#t~ite5_Out-1758748042| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758748042, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1758748042} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758748042, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1758748042, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-1758748042|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 23:04:50,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1533758363 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1533758363 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1533758363 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1533758363 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1533758363 |P1Thread1of1ForFork2_#t~ite6_Out1533758363|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out1533758363|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1533758363, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1533758363, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1533758363, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1533758363} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1533758363, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1533758363, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1533758363, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out1533758363|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1533758363} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 23:04:50,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In2025307694 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2025307694 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out2025307694| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite7_Out2025307694| ~y$r_buff0_thd2~0_In2025307694)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2025307694, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2025307694} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2025307694, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2025307694, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out2025307694|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 23:04:50,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1027412878 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1027412878 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1027412878 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1027412878 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite12_Out-1027412878| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite12_Out-1027412878| ~y$w_buff1_used~0_In-1027412878)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1027412878, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1027412878, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1027412878, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1027412878} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1027412878, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1027412878, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1027412878|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1027412878, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1027412878} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-26 23:04:50,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-574855033 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-574855033 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-574855033 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-574855033 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out-574855033| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite8_Out-574855033| ~y$r_buff1_thd2~0_In-574855033) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-574855033, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-574855033, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-574855033, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-574855033} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-574855033, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-574855033, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-574855033|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-574855033, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-574855033} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 23:04:50,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L752-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite8_28| v_~y$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, 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-26 23:04:50,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In932760460 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In932760460 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out932760460)) (and (= ~y$r_buff0_thd3~0_In932760460 ~y$r_buff0_thd3~0_Out932760460) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In932760460, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In932760460} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In932760460, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out932760460, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out932760460|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-26 23:04:50,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In68971244 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In68971244 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In68971244 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In68971244 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite14_Out68971244|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out68971244| ~y$r_buff1_thd3~0_In68971244)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In68971244, ~y$w_buff0_used~0=~y$w_buff0_used~0_In68971244, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In68971244, ~y$w_buff1_used~0=~y$w_buff1_used~0_In68971244} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out68971244|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In68971244, ~y$w_buff0_used~0=~y$w_buff0_used~0_In68971244, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In68971244, ~y$w_buff1_used~0=~y$w_buff1_used~0_In68971244} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-26 23:04:50,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_40| v_~y$r_buff1_thd3~0_68) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_68, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, 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-26 23:04:50,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:04:50,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-411175274 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-411175274 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite18_Out-411175274| ~y~0_In-411175274)) (and (= ~y$w_buff1~0_In-411175274 |ULTIMATE.start_main_#t~ite18_Out-411175274|) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-411175274, ~y~0=~y~0_In-411175274, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-411175274, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-411175274} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-411175274, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-411175274|, ~y~0=~y~0_In-411175274, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-411175274, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-411175274} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-26 23:04:50,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_40 |v_ULTIMATE.start_main_#t~ite18_13|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-26 23:04:50,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1551917888 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1551917888 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out1551917888|)) (and (= |ULTIMATE.start_main_#t~ite20_Out1551917888| ~y$w_buff0_used~0_In1551917888) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1551917888, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1551917888} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1551917888, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1551917888, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1551917888|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 23:04:50,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1487036042 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1487036042 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1487036042 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1487036042 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out1487036042|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1487036042 |ULTIMATE.start_main_#t~ite21_Out1487036042|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1487036042, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1487036042, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1487036042, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1487036042} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1487036042, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1487036042, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1487036042|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1487036042, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1487036042} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 23:04:50,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1459275376 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1459275376 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out1459275376| ~y$r_buff0_thd0~0_In1459275376) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite22_Out1459275376| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1459275376, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1459275376} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1459275376, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1459275376, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1459275376|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 23:04:50,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In284496968 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In284496968 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In284496968 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In284496968 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In284496968 |ULTIMATE.start_main_#t~ite23_Out284496968|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out284496968|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In284496968, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In284496968, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In284496968, ~y$w_buff1_used~0=~y$w_buff1_used~0_In284496968} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In284496968, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In284496968, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In284496968, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out284496968|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In284496968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 23:04:50,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In383703634 256)))) (or (and (= ~y$w_buff0~0_In383703634 |ULTIMATE.start_main_#t~ite30_Out383703634|) (not .cse0) (= |ULTIMATE.start_main_#t~ite29_In383703634| |ULTIMATE.start_main_#t~ite29_Out383703634|)) (and (= |ULTIMATE.start_main_#t~ite29_Out383703634| |ULTIMATE.start_main_#t~ite30_Out383703634|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In383703634 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In383703634 256)) (and (= (mod ~y$w_buff1_used~0_In383703634 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In383703634 256) 0)))) (= ~y$w_buff0~0_In383703634 |ULTIMATE.start_main_#t~ite29_Out383703634|) .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In383703634, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In383703634|, ~y$w_buff0~0=~y$w_buff0~0_In383703634, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In383703634, ~weak$$choice2~0=~weak$$choice2~0_In383703634, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In383703634, ~y$w_buff1_used~0=~y$w_buff1_used~0_In383703634} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out383703634|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In383703634, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out383703634|, ~y$w_buff0~0=~y$w_buff0~0_In383703634, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In383703634, ~weak$$choice2~0=~weak$$choice2~0_In383703634, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In383703634, ~y$w_buff1_used~0=~y$w_buff1_used~0_In383703634} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 23:04:50,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_86 v_~y$r_buff0_thd0~0_85)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_27, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} 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-26 23:04:50,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L829-->L832-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_12 256)) (= v_~y~0_109 v_~y$mem_tmp~0_21) (not (= 0 (mod v_~y$flush_delayed~0_33 256))) (= 0 v_~y$flush_delayed~0_32)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_109, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~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-26 23:04:50,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:04:50,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:04:50 BasicIcfg [2019-12-26 23:04:50,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:04:50,753 INFO L168 Benchmark]: Toolchain (without parser) took 20306.36 ms. Allocated memory was 145.8 MB in the beginning and 865.6 MB in the end (delta: 719.8 MB). Free memory was 101.7 MB in the beginning and 396.1 MB in the end (delta: -294.4 MB). Peak memory consumption was 425.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:04:50,754 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 23:04:50,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.70 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 101.5 MB in the beginning and 155.8 MB in the end (delta: -54.3 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:04:50,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.77 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 152.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:04:50,759 INFO L168 Benchmark]: Boogie Preprocessor took 53.17 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 150.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:04:50,760 INFO L168 Benchmark]: RCFGBuilder took 775.58 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 103.7 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:04:50,761 INFO L168 Benchmark]: TraceAbstraction took 18642.65 ms. Allocated memory was 201.9 MB in the beginning and 865.6 MB in the end (delta: 663.7 MB). Free memory was 103.7 MB in the beginning and 396.1 MB in the end (delta: -292.5 MB). Peak memory consumption was 371.3 MB. Max. memory is 7.1 GB. [2019-12-26 23:04:50,770 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.46 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 746.70 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 101.5 MB in the beginning and 155.8 MB in the end (delta: -54.3 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.77 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 152.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.17 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 150.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 775.58 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 103.7 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18642.65 ms. Allocated memory was 201.9 MB in the beginning and 865.6 MB in the end (delta: 663.7 MB). Free memory was 103.7 MB in the beginning and 396.1 MB in the end (delta: -292.5 MB). Peak memory consumption was 371.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 3955 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 45 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 48383 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1507, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L802] FCALL, FORK 0 pthread_create(&t1508, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L804] FCALL, FORK 0 pthread_create(&t1509, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0] [L777] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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] [L777] 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) [L748] 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=1, __unbuffered_p2_EAX=0, 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=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 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 [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 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 [L810] 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=0, 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] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 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 [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 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 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L821] 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=0, 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] [L821] 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) [L822] 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)) [L823] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L823] 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)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L824] 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)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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] [L825] 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)) [L827] 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=0, 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] [L827] 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)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1420 SDtfs, 1648 SDslu, 4458 SDs, 0 SdLazy, 3322 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 15 SyntacticMatches, 9 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22166occurred 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: 2.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 4023 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 637 NumberOfCodeBlocks, 637 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 566 ConstructedInterpolants, 0 QuantifiedInterpolants, 174576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...