/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:56:20,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:56:20,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:56:20,048 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:56:20,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:56:20,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:56:20,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:56:20,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:56:20,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:56:20,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:56:20,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:56:20,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:56:20,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:56:20,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:56:20,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:56:20,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:56:20,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:56:20,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:56:20,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:56:20,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:56:20,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:56:20,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:56:20,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:56:20,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:56:20,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:56:20,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:56:20,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:56:20,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:56:20,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:56:20,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:56:20,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:56:20,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:56:20,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:56:20,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:56:20,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:56:20,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:56:20,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:56:20,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:56:20,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:56:20,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:56:20,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:56:20,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:56:20,099 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:56:20,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:56:20,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:56:20,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:56:20,101 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:56:20,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:56:20,101 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:56:20,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:56:20,102 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:56:20,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:56:20,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:56:20,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:56:20,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:56:20,102 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:56:20,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:56:20,103 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:56:20,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:56:20,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:56:20,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:56:20,104 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:56:20,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:56:20,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:56:20,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:56:20,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:56:20,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:56:20,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:56:20,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:56:20,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:56:20,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:56:20,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:56:20,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:56:20,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:56:20,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:56:20,417 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:56:20,418 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i [2019-12-18 17:56:20,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101b8c23b/f3ac143ef6ea487fa534a94d40743231/FLAGcd13e2c56 [2019-12-18 17:56:21,099 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:56:21,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i [2019-12-18 17:56:21,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101b8c23b/f3ac143ef6ea487fa534a94d40743231/FLAGcd13e2c56 [2019-12-18 17:56:21,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101b8c23b/f3ac143ef6ea487fa534a94d40743231 [2019-12-18 17:56:21,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:56:21,330 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:56:21,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:56:21,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:56:21,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:56:21,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:56:21" (1/1) ... [2019-12-18 17:56:21,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4acb9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:56:21, skipping insertion in model container [2019-12-18 17:56:21,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:56:21" (1/1) ... [2019-12-18 17:56:21,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:56:21,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:56:21,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:56:21,964 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:56:22,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:56:22,111 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:56:22,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:56:22 WrapperNode [2019-12-18 17:56:22,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:56:22,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:56:22,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:56:22,113 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:56:22,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:56:22" (1/1) ... [2019-12-18 17:56:22,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:56:22" (1/1) ... [2019-12-18 17:56:22,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:56:22,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:56:22,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:56:22,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:56:22,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:56:22" (1/1) ... [2019-12-18 17:56:22,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:56:22" (1/1) ... [2019-12-18 17:56:22,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:56:22" (1/1) ... [2019-12-18 17:56:22,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:56:22" (1/1) ... [2019-12-18 17:56:22,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:56:22" (1/1) ... [2019-12-18 17:56:22,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:56:22" (1/1) ... [2019-12-18 17:56:22,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:56:22" (1/1) ... [2019-12-18 17:56:22,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:56:22,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:56:22,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:56:22,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:56:22,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:56:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:56:22,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:56:22,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:56:22,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:56:22,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:56:22,295 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:56:22,295 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:56:22,295 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:56:22,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:56:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:56:22,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:56:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:56:22,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:56:22,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:56:22,299 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:56:23,052 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:56:23,053 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:56:23,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:56:23 BoogieIcfgContainer [2019-12-18 17:56:23,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:56:23,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:56:23,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:56:23,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:56:23,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:56:21" (1/3) ... [2019-12-18 17:56:23,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2dd262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:56:23, skipping insertion in model container [2019-12-18 17:56:23,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:56:22" (2/3) ... [2019-12-18 17:56:23,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2dd262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:56:23, skipping insertion in model container [2019-12-18 17:56:23,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:56:23" (3/3) ... [2019-12-18 17:56:23,068 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_tso.opt.i [2019-12-18 17:56:23,079 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:56:23,079 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:56:23,090 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:56:23,092 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:56:23,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,146 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,146 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,148 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,148 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,156 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,156 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,157 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,157 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,157 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,168 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,170 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,170 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,174 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,174 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,177 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,178 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:56:23,216 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:56:23,238 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:56:23,238 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:56:23,239 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:56:23,239 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:56:23,239 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:56:23,239 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:56:23,239 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:56:23,239 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:56:23,257 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 17:56:23,259 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 17:56:23,341 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 17:56:23,342 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:56:23,358 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. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:56:23,378 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 17:56:23,423 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 17:56:23,424 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:56:23,429 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. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 17:56:23,444 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 17:56:23,445 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:56:28,461 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 17:56:28,578 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 17:56:28,600 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48383 [2019-12-18 17:56:28,600 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 17:56:28,604 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-18 17:56:29,645 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16526 states. [2019-12-18 17:56:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states. [2019-12-18 17:56:29,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 17:56:29,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:29,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:56:29,655 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-18 17:56:29,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:29,661 INFO L82 PathProgramCache]: Analyzing trace with hash 2128093424, now seen corresponding path program 1 times [2019-12-18 17:56:29,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:29,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132058073] [2019-12-18 17:56:29,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:29,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132058073] [2019-12-18 17:56:29,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:29,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:56:29,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273952929] [2019-12-18 17:56:30,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:56:30,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:30,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:56:30,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:56:30,022 INFO L87 Difference]: Start difference. First operand 16526 states. Second operand 3 states. [2019-12-18 17:56:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:30,508 INFO L93 Difference]: Finished difference Result 16398 states and 61580 transitions. [2019-12-18 17:56:30,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:56:30,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 17:56:30,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:30,760 INFO L225 Difference]: With dead ends: 16398 [2019-12-18 17:56:30,760 INFO L226 Difference]: Without dead ends: 16062 [2019-12-18 17:56:30,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:56:30,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16062 states. [2019-12-18 17:56:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16062 to 16062. [2019-12-18 17:56:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16062 states. [2019-12-18 17:56:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 60376 transitions. [2019-12-18 17:56:31,569 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 60376 transitions. Word has length 7 [2019-12-18 17:56:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:31,571 INFO L462 AbstractCegarLoop]: Abstraction has 16062 states and 60376 transitions. [2019-12-18 17:56:31,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:56:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 60376 transitions. [2019-12-18 17:56:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:56:31,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:31,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:56:31,576 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-18 17:56:31,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:31,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1390331573, now seen corresponding path program 1 times [2019-12-18 17:56:31,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:31,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525120347] [2019-12-18 17:56:31,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:31,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525120347] [2019-12-18 17:56:31,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:31,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:56:31,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052347243] [2019-12-18 17:56:31,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:56:31,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:31,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:56:31,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:56:31,657 INFO L87 Difference]: Start difference. First operand 16062 states and 60376 transitions. Second operand 4 states. [2019-12-18 17:56:33,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:33,379 INFO L93 Difference]: Finished difference Result 24942 states and 90524 transitions. [2019-12-18 17:56:33,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:56:33,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:56:33,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:33,488 INFO L225 Difference]: With dead ends: 24942 [2019-12-18 17:56:33,489 INFO L226 Difference]: Without dead ends: 24928 [2019-12-18 17:56:33,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:56:33,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24928 states. [2019-12-18 17:56:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24928 to 22166. [2019-12-18 17:56:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22166 states. [2019-12-18 17:56:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22166 states to 22166 states and 81470 transitions. [2019-12-18 17:56:34,326 INFO L78 Accepts]: Start accepts. Automaton has 22166 states and 81470 transitions. Word has length 13 [2019-12-18 17:56:34,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:34,326 INFO L462 AbstractCegarLoop]: Abstraction has 22166 states and 81470 transitions. [2019-12-18 17:56:34,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:56:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 22166 states and 81470 transitions. [2019-12-18 17:56:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:56:34,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:34,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:56:34,330 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-18 17:56:34,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:34,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1371832765, now seen corresponding path program 1 times [2019-12-18 17:56:34,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:34,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5795326] [2019-12-18 17:56:34,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:34,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5795326] [2019-12-18 17:56:34,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:34,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:56:34,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212003757] [2019-12-18 17:56:34,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:56:34,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:34,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:56:34,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:56:34,382 INFO L87 Difference]: Start difference. First operand 22166 states and 81470 transitions. Second operand 3 states. [2019-12-18 17:56:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:34,453 INFO L93 Difference]: Finished difference Result 12675 states and 40338 transitions. [2019-12-18 17:56:34,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:56:34,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:56:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:34,498 INFO L225 Difference]: With dead ends: 12675 [2019-12-18 17:56:34,499 INFO L226 Difference]: Without dead ends: 12675 [2019-12-18 17:56:34,499 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-18 17:56:34,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12675 states. [2019-12-18 17:56:34,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12675 to 12675. [2019-12-18 17:56:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12675 states. [2019-12-18 17:56:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12675 states to 12675 states and 40338 transitions. [2019-12-18 17:56:34,891 INFO L78 Accepts]: Start accepts. Automaton has 12675 states and 40338 transitions. Word has length 13 [2019-12-18 17:56:34,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:34,892 INFO L462 AbstractCegarLoop]: Abstraction has 12675 states and 40338 transitions. [2019-12-18 17:56:34,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:56:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 12675 states and 40338 transitions. [2019-12-18 17:56:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:56:34,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:34,894 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:56:34,894 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-18 17:56:34,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:34,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1884008947, now seen corresponding path program 1 times [2019-12-18 17:56:34,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:34,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398860195] [2019-12-18 17:56:34,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:34,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398860195] [2019-12-18 17:56:34,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:34,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:56:34,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884957350] [2019-12-18 17:56:34,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:56:34,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:34,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:56:34,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:56:34,962 INFO L87 Difference]: Start difference. First operand 12675 states and 40338 transitions. Second operand 4 states. [2019-12-18 17:56:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:34,988 INFO L93 Difference]: Finished difference Result 1939 states and 4540 transitions. [2019-12-18 17:56:34,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:56:34,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:56:34,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:34,994 INFO L225 Difference]: With dead ends: 1939 [2019-12-18 17:56:34,994 INFO L226 Difference]: Without dead ends: 1939 [2019-12-18 17:56:34,995 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-18 17:56:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-18 17:56:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2019-12-18 17:56:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-18 17:56:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4540 transitions. [2019-12-18 17:56:35,109 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4540 transitions. Word has length 14 [2019-12-18 17:56:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:35,110 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4540 transitions. [2019-12-18 17:56:35,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:56:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4540 transitions. [2019-12-18 17:56:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:56:35,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:35,113 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-18 17:56:35,113 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-18 17:56:35,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:35,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1748149180, now seen corresponding path program 1 times [2019-12-18 17:56:35,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:35,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108639340] [2019-12-18 17:56:35,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:35,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108639340] [2019-12-18 17:56:35,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:35,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:56:35,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912439619] [2019-12-18 17:56:35,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:56:35,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:35,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:56:35,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:56:35,261 INFO L87 Difference]: Start difference. First operand 1939 states and 4540 transitions. Second operand 5 states. [2019-12-18 17:56:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:35,286 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-18 17:56:35,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:56:35,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 17:56:35,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:35,289 INFO L225 Difference]: With dead ends: 653 [2019-12-18 17:56:35,289 INFO L226 Difference]: Without dead ends: 653 [2019-12-18 17:56:35,289 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-18 17:56:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-18 17:56:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-18 17:56:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-18 17:56:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-18 17:56:35,300 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-18 17:56:35,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:35,300 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-18 17:56:35,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:56:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-18 17:56:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:56:35,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:35,306 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-18 17:56:35,306 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-18 17:56:35,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:35,306 INFO L82 PathProgramCache]: Analyzing trace with hash 306322931, now seen corresponding path program 1 times [2019-12-18 17:56:35,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:35,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894653086] [2019-12-18 17:56:35,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:35,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894653086] [2019-12-18 17:56:35,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:35,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:56:35,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958019857] [2019-12-18 17:56:35,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:56:35,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:35,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:56:35,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:56:35,453 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-18 17:56:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:35,502 INFO L93 Difference]: Finished difference Result 607 states and 1414 transitions. [2019-12-18 17:56:35,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:56:35,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:56:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:35,505 INFO L225 Difference]: With dead ends: 607 [2019-12-18 17:56:35,505 INFO L226 Difference]: Without dead ends: 607 [2019-12-18 17:56:35,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:56:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-18 17:56:35,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2019-12-18 17:56:35,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-12-18 17:56:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1410 transitions. [2019-12-18 17:56:35,516 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1410 transitions. Word has length 55 [2019-12-18 17:56:35,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:35,517 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1410 transitions. [2019-12-18 17:56:35,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:56:35,517 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1410 transitions. [2019-12-18 17:56:35,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:56:35,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:35,519 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-18 17:56:35,519 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-18 17:56:35,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:35,520 INFO L82 PathProgramCache]: Analyzing trace with hash -826083081, now seen corresponding path program 1 times [2019-12-18 17:56:35,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:35,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321210289] [2019-12-18 17:56:35,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:35,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321210289] [2019-12-18 17:56:35,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:35,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:56:35,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822167943] [2019-12-18 17:56:35,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:56:35,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:35,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:56:35,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:56:35,679 INFO L87 Difference]: Start difference. First operand 603 states and 1410 transitions. Second operand 5 states. [2019-12-18 17:56:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:35,922 INFO L93 Difference]: Finished difference Result 892 states and 2082 transitions. [2019-12-18 17:56:35,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:56:35,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 17:56:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:35,925 INFO L225 Difference]: With dead ends: 892 [2019-12-18 17:56:35,925 INFO L226 Difference]: Without dead ends: 892 [2019-12-18 17:56:35,925 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-18 17:56:35,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-12-18 17:56:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 717. [2019-12-18 17:56:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-12-18 17:56:35,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1691 transitions. [2019-12-18 17:56:35,939 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1691 transitions. Word has length 55 [2019-12-18 17:56:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:35,939 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1691 transitions. [2019-12-18 17:56:35,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:56:35,940 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1691 transitions. [2019-12-18 17:56:35,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:56:35,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:35,942 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-18 17:56:35,942 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-18 17:56:35,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:35,943 INFO L82 PathProgramCache]: Analyzing trace with hash 297273929, now seen corresponding path program 2 times [2019-12-18 17:56:35,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:35,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359036489] [2019-12-18 17:56:35,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:36,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:36,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359036489] [2019-12-18 17:56:36,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:36,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:56:36,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212387917] [2019-12-18 17:56:36,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:56:36,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:36,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:56:36,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:56:36,057 INFO L87 Difference]: Start difference. First operand 717 states and 1691 transitions. Second operand 6 states. [2019-12-18 17:56:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:36,360 INFO L93 Difference]: Finished difference Result 1189 states and 2773 transitions. [2019-12-18 17:56:36,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:56:36,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 17:56:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:36,363 INFO L225 Difference]: With dead ends: 1189 [2019-12-18 17:56:36,364 INFO L226 Difference]: Without dead ends: 1189 [2019-12-18 17:56:36,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:56:36,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-12-18 17:56:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 759. [2019-12-18 17:56:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-18 17:56:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1794 transitions. [2019-12-18 17:56:36,379 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1794 transitions. Word has length 55 [2019-12-18 17:56:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:36,379 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1794 transitions. [2019-12-18 17:56:36,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:56:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1794 transitions. [2019-12-18 17:56:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 17:56:36,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:36,382 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-18 17:56:36,382 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-18 17:56:36,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:36,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1649215159, now seen corresponding path program 3 times [2019-12-18 17:56:36,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:36,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048205193] [2019-12-18 17:56:36,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:36,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048205193] [2019-12-18 17:56:36,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:36,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:56:36,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274749844] [2019-12-18 17:56:36,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:56:36,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:36,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:56:36,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:56:36,447 INFO L87 Difference]: Start difference. First operand 759 states and 1794 transitions. Second operand 3 states. [2019-12-18 17:56:36,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:36,464 INFO L93 Difference]: Finished difference Result 687 states and 1586 transitions. [2019-12-18 17:56:36,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:56:36,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 17:56:36,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:36,466 INFO L225 Difference]: With dead ends: 687 [2019-12-18 17:56:36,467 INFO L226 Difference]: Without dead ends: 687 [2019-12-18 17:56:36,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:56:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-12-18 17:56:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 663. [2019-12-18 17:56:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-12-18 17:56:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1530 transitions. [2019-12-18 17:56:36,477 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1530 transitions. Word has length 55 [2019-12-18 17:56:36,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:36,478 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 1530 transitions. [2019-12-18 17:56:36,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:56:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1530 transitions. [2019-12-18 17:56:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 17:56:36,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:36,480 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-18 17:56:36,480 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-18 17:56:36,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:36,480 INFO L82 PathProgramCache]: Analyzing trace with hash 684538364, now seen corresponding path program 1 times [2019-12-18 17:56:36,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:36,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650304233] [2019-12-18 17:56:36,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:36,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650304233] [2019-12-18 17:56:36,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:36,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:56:36,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711175476] [2019-12-18 17:56:36,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:56:36,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:36,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:56:36,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:56:36,550 INFO L87 Difference]: Start difference. First operand 663 states and 1530 transitions. Second operand 3 states. [2019-12-18 17:56:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:36,604 INFO L93 Difference]: Finished difference Result 662 states and 1528 transitions. [2019-12-18 17:56:36,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:56:36,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 17:56:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:36,607 INFO L225 Difference]: With dead ends: 662 [2019-12-18 17:56:36,607 INFO L226 Difference]: Without dead ends: 662 [2019-12-18 17:56:36,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:56:36,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-12-18 17:56:36,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 473. [2019-12-18 17:56:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-12-18 17:56:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1090 transitions. [2019-12-18 17:56:36,619 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1090 transitions. Word has length 56 [2019-12-18 17:56:36,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:36,620 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 1090 transitions. [2019-12-18 17:56:36,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:56:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1090 transitions. [2019-12-18 17:56:36,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:56:36,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:36,622 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-18 17:56:36,622 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-18 17:56:36,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:36,622 INFO L82 PathProgramCache]: Analyzing trace with hash 816342703, now seen corresponding path program 1 times [2019-12-18 17:56:36,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:36,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392965496] [2019-12-18 17:56:36,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:36,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392965496] [2019-12-18 17:56:36,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:36,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:56:36,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122546922] [2019-12-18 17:56:36,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:56:36,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:36,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:56:36,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:56:36,948 INFO L87 Difference]: Start difference. First operand 473 states and 1090 transitions. Second operand 12 states. [2019-12-18 17:56:37,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:37,796 INFO L93 Difference]: Finished difference Result 1088 states and 2214 transitions. [2019-12-18 17:56:37,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:56:37,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 17:56:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:37,799 INFO L225 Difference]: With dead ends: 1088 [2019-12-18 17:56:37,800 INFO L226 Difference]: Without dead ends: 578 [2019-12-18 17:56:37,800 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-18 17:56:37,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-12-18 17:56:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 411. [2019-12-18 17:56:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-18 17:56:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 911 transitions. [2019-12-18 17:56:37,808 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 911 transitions. Word has length 57 [2019-12-18 17:56:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:37,809 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 911 transitions. [2019-12-18 17:56:37,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:56:37,809 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 911 transitions. [2019-12-18 17:56:37,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:56:37,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:37,810 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-18 17:56:37,811 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-18 17:56:37,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:37,811 INFO L82 PathProgramCache]: Analyzing trace with hash 729563135, now seen corresponding path program 2 times [2019-12-18 17:56:37,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:37,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369515800] [2019-12-18 17:56:37,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:37,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369515800] [2019-12-18 17:56:37,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:37,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:56:37,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266134106] [2019-12-18 17:56:37,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:56:37,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:37,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:56:37,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:56:37,919 INFO L87 Difference]: Start difference. First operand 411 states and 911 transitions. Second operand 5 states. [2019-12-18 17:56:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:37,960 INFO L93 Difference]: Finished difference Result 587 states and 1222 transitions. [2019-12-18 17:56:37,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:56:37,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 17:56:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:37,961 INFO L225 Difference]: With dead ends: 587 [2019-12-18 17:56:37,961 INFO L226 Difference]: Without dead ends: 207 [2019-12-18 17:56:37,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:56:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-12-18 17:56:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-12-18 17:56:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-18 17:56:37,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 364 transitions. [2019-12-18 17:56:37,966 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 364 transitions. Word has length 57 [2019-12-18 17:56:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:37,966 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 364 transitions. [2019-12-18 17:56:37,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:56:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 364 transitions. [2019-12-18 17:56:37,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:56:37,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:37,967 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-18 17:56:37,967 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-18 17:56:37,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:37,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1516556909, now seen corresponding path program 3 times [2019-12-18 17:56:37,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:37,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387585282] [2019-12-18 17:56:37,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:38,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387585282] [2019-12-18 17:56:38,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:38,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:56:38,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64659753] [2019-12-18 17:56:38,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 17:56:38,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:38,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 17:56:38,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:56:38,210 INFO L87 Difference]: Start difference. First operand 207 states and 364 transitions. Second operand 13 states. [2019-12-18 17:56:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:38,771 INFO L93 Difference]: Finished difference Result 371 states and 637 transitions. [2019-12-18 17:56:38,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:56:38,771 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 17:56:38,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:38,772 INFO L225 Difference]: With dead ends: 371 [2019-12-18 17:56:38,773 INFO L226 Difference]: Without dead ends: 341 [2019-12-18 17:56:38,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-18 17:56:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-12-18 17:56:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 307. [2019-12-18 17:56:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-18 17:56:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-12-18 17:56:38,779 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 57 [2019-12-18 17:56:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:38,779 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-12-18 17:56:38,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 17:56:38,779 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-12-18 17:56:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:56:38,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:38,780 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-18 17:56:38,781 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-18 17:56:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:38,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1834190715, now seen corresponding path program 4 times [2019-12-18 17:56:38,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:38,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628678128] [2019-12-18 17:56:38,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:56:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:56:39,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628678128] [2019-12-18 17:56:39,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:56:39,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 17:56:39,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199413819] [2019-12-18 17:56:39,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 17:56:39,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:56:39,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 17:56:39,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 17:56:39,048 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 14 states. [2019-12-18 17:56:39,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:56:39,547 INFO L93 Difference]: Finished difference Result 415 states and 703 transitions. [2019-12-18 17:56:39,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:56:39,547 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-18 17:56:39,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:56:39,549 INFO L225 Difference]: With dead ends: 415 [2019-12-18 17:56:39,549 INFO L226 Difference]: Without dead ends: 385 [2019-12-18 17:56:39,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-18 17:56:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-18 17:56:39,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 315. [2019-12-18 17:56:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-12-18 17:56:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 549 transitions. [2019-12-18 17:56:39,556 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 549 transitions. Word has length 57 [2019-12-18 17:56:39,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:56:39,557 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 549 transitions. [2019-12-18 17:56:39,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 17:56:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 549 transitions. [2019-12-18 17:56:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:56:39,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:56:39,558 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-18 17:56:39,558 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-18 17:56:39,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:56:39,559 INFO L82 PathProgramCache]: Analyzing trace with hash 731376245, now seen corresponding path program 5 times [2019-12-18 17:56:39,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:56:39,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089923931] [2019-12-18 17:56:39,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:56:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:56:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:56:39,662 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:56:39,663 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:56:39,667 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) (= 0 v_~weak$$choice0~0_25) (= 0 v_~y$r_buff0_thd3~0_151) (= v_~y$w_buff1~0_200 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1510~0.base_26|)) (= v_~y$w_buff0_used~0_650 0) (= 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_~#t1510~0.base_26| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1510~0.base_26| 4) |v_#length_23|) (= 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) (= v_~y$r_buff0_thd2~0_88 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1510~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1510~0.base_26|) |v_ULTIMATE.start_main_~#t1510~0.offset_19| 0)) |v_#memory_int_23|) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff1_thd2~0_131) (= v_~y$mem_tmp~0_31 0) (= |v_ULTIMATE.start_main_~#t1510~0.offset_19| 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_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1510~0.base_26|) (= 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|, ULTIMATE.start_main_~#t1511~0.offset=|v_ULTIMATE.start_main_~#t1511~0.offset_19|, #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_#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, ULTIMATE.start_main_~#t1510~0.base=|v_ULTIMATE.start_main_~#t1510~0.base_26|, #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, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_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_~#t1512~0.base=|v_ULTIMATE.start_main_~#t1512~0.base_21|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ULTIMATE.start_main_~#t1510~0.offset=|v_ULTIMATE.start_main_~#t1510~0.offset_19|, ~y$w_buff0~0=v_~y$w_buff0~0_308, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ~y~0=v_~y~0_150, 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|, ~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|, ULTIMATE.start_main_~#t1512~0.offset=|v_ULTIMATE.start_main_~#t1512~0.offset_14|, ~z~0=v_~z~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_131, ULTIMATE.start_main_~#t1511~0.base=|v_ULTIMATE.start_main_~#t1511~0.base_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1511~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1510~0.base, #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, ~y$read_delayed_var~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_~#t1512~0.base, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1510~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1512~0.offset, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1511~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:56:39,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L800-1-->L802: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1511~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t1511~0.offset_11| 0) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1511~0.base_13|) 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1511~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1511~0.base_13|) |v_ULTIMATE.start_main_~#t1511~0.offset_11| 1))) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1511~0.base_13| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1511~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1511~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1511~0.offset=|v_ULTIMATE.start_main_~#t1511~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1511~0.base=|v_ULTIMATE.start_main_~#t1511~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1511~0.offset, #length, ULTIMATE.start_main_~#t1511~0.base] because there is no mapped edge [2019-12-18 17:56:39,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L802-1-->L804: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1512~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1512~0.base_12|) |v_ULTIMATE.start_main_~#t1512~0.offset_10| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1512~0.base_12|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1512~0.base_12|) 0) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1512~0.base_12| 1) |v_#valid_38|) (not (= |v_ULTIMATE.start_main_~#t1512~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1512~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1512~0.base_12| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1512~0.base=|v_ULTIMATE.start_main_~#t1512~0.base_12|, #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_~#t1512~0.offset=|v_ULTIMATE.start_main_~#t1512~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1512~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1512~0.offset, #length] because there is no mapped edge [2019-12-18 17:56:39,670 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-18 17:56:39,670 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-18 17:56:39,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1495867866 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1495867866 256) 0))) (or (and (= ~y$w_buff0_used~0_In1495867866 |P2Thread1of1ForFork0_#t~ite11_Out1495867866|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out1495867866|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1495867866, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1495867866} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1495867866, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1495867866|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1495867866} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 17:56:39,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2024995035 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-2024995035 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-2024995035| ~y$w_buff1~0_In-2024995035)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-2024995035| ~y~0_In-2024995035)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2024995035, ~y$w_buff1~0=~y$w_buff1~0_In-2024995035, ~y~0=~y~0_In-2024995035, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2024995035} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2024995035, ~y$w_buff1~0=~y$w_buff1~0_In-2024995035, ~y~0=~y~0_In-2024995035, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-2024995035|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2024995035} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 17:56:39,673 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-18 17:56:39,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1772733630 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1772733630 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-1772733630|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1772733630 |P1Thread1of1ForFork2_#t~ite5_Out-1772733630|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1772733630, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1772733630} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1772733630, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1772733630, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-1772733630|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 17:56:39,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-799658373 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-799658373 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-799658373 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-799658373 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-799658373 |P1Thread1of1ForFork2_#t~ite6_Out-799658373|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-799658373|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-799658373, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-799658373, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-799658373, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-799658373} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-799658373, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-799658373, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-799658373, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-799658373|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-799658373} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 17:56:39,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1156751777 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1156751777 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite7_Out1156751777| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite7_Out1156751777| ~y$r_buff0_thd2~0_In1156751777) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1156751777, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1156751777} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1156751777, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1156751777, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out1156751777|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 17:56:39,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1210896523 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In1210896523 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1210896523 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1210896523 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out1210896523|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1210896523 |P2Thread1of1ForFork0_#t~ite12_Out1210896523|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1210896523, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1210896523, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1210896523, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1210896523} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1210896523, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1210896523, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1210896523|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1210896523, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1210896523} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 17:56:39,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1382064545 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1382064545 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1382064545 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1382064545 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out1382064545| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite8_Out1382064545| ~y$r_buff1_thd2~0_In1382064545)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1382064545, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1382064545, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1382064545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1382064545} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1382064545, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1382064545, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1382064545|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1382064545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1382064545} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:56:39,677 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-18 17:56:39,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1739036730 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1739036730 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out1739036730 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_Out1739036730 ~y$r_buff0_thd3~0_In1739036730)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1739036730, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1739036730} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1739036730, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1739036730, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out1739036730|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 17:56:39,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1862865987 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In1862865987 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1862865987 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1862865987 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out1862865987| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite14_Out1862865987| ~y$r_buff1_thd3~0_In1862865987)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1862865987, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1862865987, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1862865987, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1862865987} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1862865987|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1862865987, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1862865987, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1862865987, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1862865987} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 17:56:39,679 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-18 17:56:39,679 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-18 17:56:39,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1392007150 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1392007150 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite18_Out1392007150| ~y$w_buff1~0_In1392007150) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite18_Out1392007150| ~y~0_In1392007150)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1392007150, ~y~0=~y~0_In1392007150, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1392007150, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1392007150} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1392007150, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1392007150|, ~y~0=~y~0_In1392007150, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1392007150, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1392007150} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 17:56:39,681 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-18 17:56:39,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In526384523 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In526384523 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out526384523|)) (and (= ~y$w_buff0_used~0_In526384523 |ULTIMATE.start_main_#t~ite20_Out526384523|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In526384523, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In526384523} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In526384523, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In526384523, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out526384523|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:56:39,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In714562578 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In714562578 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In714562578 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In714562578 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out714562578| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out714562578| ~y$w_buff1_used~0_In714562578)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In714562578, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In714562578, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In714562578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In714562578} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In714562578, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In714562578, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out714562578|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In714562578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In714562578} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:56:39,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1602028004 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1602028004 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-1602028004| 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-1602028004 |ULTIMATE.start_main_#t~ite22_Out-1602028004|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1602028004, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1602028004} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1602028004, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1602028004, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1602028004|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:56:39,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1388294289 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1388294289 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1388294289 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1388294289 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In-1388294289 |ULTIMATE.start_main_#t~ite23_Out-1388294289|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1388294289|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1388294289, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1388294289, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1388294289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1388294289} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1388294289, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1388294289, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1388294289, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1388294289|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1388294289} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:56:39,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-679945461 256)))) (or (and (= ~y$w_buff0~0_In-679945461 |ULTIMATE.start_main_#t~ite29_Out-679945461|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-679945461 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In-679945461 256) 0)) (and (= (mod ~y$r_buff1_thd0~0_In-679945461 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-679945461 256)))) (= |ULTIMATE.start_main_#t~ite30_Out-679945461| |ULTIMATE.start_main_#t~ite29_Out-679945461|) .cse1) (and (= |ULTIMATE.start_main_#t~ite30_Out-679945461| ~y$w_buff0~0_In-679945461) (= |ULTIMATE.start_main_#t~ite29_In-679945461| |ULTIMATE.start_main_#t~ite29_Out-679945461|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-679945461, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-679945461|, ~y$w_buff0~0=~y$w_buff0~0_In-679945461, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-679945461, ~weak$$choice2~0=~weak$$choice2~0_In-679945461, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-679945461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-679945461} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-679945461|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-679945461, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-679945461|, ~y$w_buff0~0=~y$w_buff0~0_In-679945461, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-679945461, ~weak$$choice2~0=~weak$$choice2~0_In-679945461, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-679945461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-679945461} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 17:56:39,691 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-18 17:56:39,693 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-18 17:56:39,693 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-18 17:56:39,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:56:39 BasicIcfg [2019-12-18 17:56:39,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:56:39,823 INFO L168 Benchmark]: Toolchain (without parser) took 18493.46 ms. Allocated memory was 145.8 MB in the beginning and 781.7 MB in the end (delta: 636.0 MB). Free memory was 103.0 MB in the beginning and 245.3 MB in the end (delta: -142.3 MB). Peak memory consumption was 493.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:56:39,823 INFO L168 Benchmark]: CDTParser took 0.23 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: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:56:39,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.62 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.6 MB in the beginning and 157.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:56:39,825 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.90 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:56:39,826 INFO L168 Benchmark]: Boogie Preprocessor took 38.68 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:56:39,830 INFO L168 Benchmark]: RCFGBuilder took 832.47 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 105.1 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:56:39,831 INFO L168 Benchmark]: TraceAbstraction took 16763.05 ms. Allocated memory was 203.4 MB in the beginning and 781.7 MB in the end (delta: 578.3 MB). Free memory was 105.1 MB in the beginning and 245.3 MB in the end (delta: -140.2 MB). Peak memory consumption was 438.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:56:39,840 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.23 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: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.62 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.6 MB in the beginning and 157.1 MB in the end (delta: -54.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.90 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.68 ms. Allocated memory is still 203.4 MB. Free memory was 154.5 MB in the beginning and 151.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.47 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 105.1 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16763.05 ms. Allocated memory was 203.4 MB in the beginning and 781.7 MB in the end (delta: 578.3 MB). Free memory was 105.1 MB in the beginning and 245.3 MB in the end (delta: -140.2 MB). Peak memory consumption was 438.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 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.4s, 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(&t1510, ((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(&t1511, ((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(&t1512, ((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: 16.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1400 SDtfs, 1490 SDslu, 3616 SDs, 0 SdLazy, 1780 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 19 SyntacticMatches, 10 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.2s 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.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 3911 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 563 ConstructedInterpolants, 0 QuantifiedInterpolants, 113323 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...