/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:41:22,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:41:22,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:41:22,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:41:22,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:41:22,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:41:22,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:41:22,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:41:22,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:41:22,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:41:22,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:41:22,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:41:22,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:41:22,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:41:22,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:41:22,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:41:22,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:41:22,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:41:22,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:41:22,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:41:22,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:41:22,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:41:22,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:41:22,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:41:22,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:41:22,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:41:22,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:41:22,169 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:41:22,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:41:22,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:41:22,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:41:22,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:41:22,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:41:22,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:41:22,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:41:22,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:41:22,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:41:22,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:41:22,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:41:22,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:41:22,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:41:22,178 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:41:22,192 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:41:22,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:41:22,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:41:22,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:41:22,194 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:41:22,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:41:22,195 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:41:22,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:41:22,195 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:41:22,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:41:22,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:41:22,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:41:22,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:41:22,196 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:41:22,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:41:22,196 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:41:22,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:41:22,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:41:22,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:41:22,197 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:41:22,197 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:41:22,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:41:22,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:41:22,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:41:22,198 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:41:22,198 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:41:22,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:41:22,199 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:41:22,199 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:41:22,199 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:41:22,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:41:22,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:41:22,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:41:22,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:41:22,545 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:41:22,546 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2019-12-26 23:41:22,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/641ce32c9/46b363abde9647519e3bc89ee5ebf60a/FLAG01005bc58 [2019-12-26 23:41:23,194 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:41:23,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2019-12-26 23:41:23,225 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/641ce32c9/46b363abde9647519e3bc89ee5ebf60a/FLAG01005bc58 [2019-12-26 23:41:23,493 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/641ce32c9/46b363abde9647519e3bc89ee5ebf60a [2019-12-26 23:41:23,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:41:23,502 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:41:23,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:41:23,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:41:23,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:41:23,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:41:23" (1/1) ... [2019-12-26 23:41:23,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36036b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:23, skipping insertion in model container [2019-12-26 23:41:23,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:41:23" (1/1) ... [2019-12-26 23:41:23,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:41:23,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:41:24,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:41:24,113 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:41:24,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:41:24,277 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:41:24,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:24 WrapperNode [2019-12-26 23:41:24,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:41:24,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:41:24,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:41:24,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:41:24,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:24" (1/1) ... [2019-12-26 23:41:24,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:24" (1/1) ... [2019-12-26 23:41:24,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:41:24,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:41:24,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:41:24,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:41:24,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:24" (1/1) ... [2019-12-26 23:41:24,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:24" (1/1) ... [2019-12-26 23:41:24,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:24" (1/1) ... [2019-12-26 23:41:24,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:24" (1/1) ... [2019-12-26 23:41:24,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:24" (1/1) ... [2019-12-26 23:41:24,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:24" (1/1) ... [2019-12-26 23:41:24,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:24" (1/1) ... [2019-12-26 23:41:24,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:41:24,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:41:24,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:41:24,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:41:24,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:41:24,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:41:24,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:41:24,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:41:24,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:41:24,492 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:41:24,492 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:41:24,492 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:41:24,492 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:41:24,493 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:41:24,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:41:24,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:41:24,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:41:24,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:41:24,495 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:41:25,245 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:41:25,245 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:41:25,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:41:25 BoogieIcfgContainer [2019-12-26 23:41:25,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:41:25,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:41:25,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:41:25,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:41:25,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:41:23" (1/3) ... [2019-12-26 23:41:25,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346a0d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:41:25, skipping insertion in model container [2019-12-26 23:41:25,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:41:24" (2/3) ... [2019-12-26 23:41:25,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@346a0d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:41:25, skipping insertion in model container [2019-12-26 23:41:25,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:41:25" (3/3) ... [2019-12-26 23:41:25,257 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_power.opt.i [2019-12-26 23:41:25,268 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:41:25,268 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:41:25,276 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:41:25,277 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:41:25,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,314 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,314 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,322 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,322 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,323 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,323 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,323 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,351 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,351 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,369 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,369 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,371 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,372 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,373 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,384 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,384 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:41:25,399 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:41:25,414 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:41:25,414 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:41:25,415 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:41:25,415 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:41:25,415 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:41:25,415 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:41:25,415 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:41:25,415 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:41:25,430 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-26 23:41:25,431 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:41:25,534 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:41:25,534 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:41:25,550 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:41:25,577 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-26 23:41:25,631 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-26 23:41:25,631 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:41:25,638 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 332 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:41:25,659 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-26 23:41:25,660 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:41:30,544 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-26 23:41:30,669 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-26 23:41:30,702 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87419 [2019-12-26 23:41:30,702 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-26 23:41:30,706 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-26 23:41:46,625 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-26 23:41:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-26 23:41:46,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:41:46,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:41:46,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:41:46,634 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:41:46,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:41:46,640 INFO L82 PathProgramCache]: Analyzing trace with hash 809706692, now seen corresponding path program 1 times [2019-12-26 23:41:46,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:41:46,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648975313] [2019-12-26 23:41:46,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:41:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:41:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:41:46,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648975313] [2019-12-26 23:41:46,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:41:46,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:41:46,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717250346] [2019-12-26 23:41:46,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:41:46,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:41:46,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:41:46,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:46,874 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-26 23:41:50,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:41:50,032 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-26 23:41:50,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:41:50,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:41:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:41:50,773 INFO L225 Difference]: With dead ends: 107108 [2019-12-26 23:41:50,773 INFO L226 Difference]: Without dead ends: 104924 [2019-12-26 23:41:50,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:41:54,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-26 23:41:57,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-26 23:41:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-26 23:42:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-26 23:42:01,621 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-26 23:42:01,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:01,622 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-26 23:42:01,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-26 23:42:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:42:01,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:01,625 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:01,626 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:01,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:01,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1056800905, now seen corresponding path program 1 times [2019-12-26 23:42:01,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:01,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217864234] [2019-12-26 23:42:01,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:01,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217864234] [2019-12-26 23:42:01,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:01,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:01,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769963509] [2019-12-26 23:42:01,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:42:01,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:01,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:42:01,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:42:01,746 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-26 23:42:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:07,121 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-26 23:42:07,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:42:07,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:42:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:07,786 INFO L225 Difference]: With dead ends: 168606 [2019-12-26 23:42:07,786 INFO L226 Difference]: Without dead ends: 168557 [2019-12-26 23:42:07,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-26 23:42:15,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-26 23:42:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-26 23:42:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-26 23:42:16,299 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-26 23:42:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:16,300 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-26 23:42:16,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:42:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-26 23:42:16,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:42:16,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:16,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:16,308 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:16,308 INFO L82 PathProgramCache]: Analyzing trace with hash 933289536, now seen corresponding path program 1 times [2019-12-26 23:42:16,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:16,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286750545] [2019-12-26 23:42:16,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:16,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286750545] [2019-12-26 23:42:16,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:16,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:16,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879417594] [2019-12-26 23:42:16,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:42:16,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:16,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:42:16,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:42:16,391 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-26 23:42:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:22,733 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-26 23:42:22,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:42:22,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:42:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:23,984 INFO L225 Difference]: With dead ends: 217678 [2019-12-26 23:42:23,984 INFO L226 Difference]: Without dead ends: 217615 [2019-12-26 23:42:23,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:28,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-26 23:42:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-26 23:42:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-26 23:42:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-26 23:42:34,388 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-26 23:42:34,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:34,389 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-26 23:42:34,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:42:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-26 23:42:34,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:42:34,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:34,393 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:34,393 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:34,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:34,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1797085387, now seen corresponding path program 1 times [2019-12-26 23:42:34,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:34,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131270877] [2019-12-26 23:42:34,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:34,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131270877] [2019-12-26 23:42:34,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:34,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:34,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347120827] [2019-12-26 23:42:34,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:34,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:34,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:34,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:34,454 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-26 23:42:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:34,590 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-26 23:42:34,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:34,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:42:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:34,646 INFO L225 Difference]: With dead ends: 36985 [2019-12-26 23:42:34,647 INFO L226 Difference]: Without dead ends: 36985 [2019-12-26 23:42:34,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:34,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-26 23:42:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-26 23:42:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-26 23:42:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-26 23:42:41,035 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-26 23:42:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:41,036 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-26 23:42:41,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-26 23:42:41,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:42:41,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:41,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:41,040 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:41,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:41,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1117796869, now seen corresponding path program 1 times [2019-12-26 23:42:41,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:41,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523889967] [2019-12-26 23:42:41,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:41,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523889967] [2019-12-26 23:42:41,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:41,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:42:41,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577576776] [2019-12-26 23:42:41,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:42:41,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:41,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:42:41,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:41,175 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 5 states. [2019-12-26 23:42:41,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:41,979 INFO L93 Difference]: Finished difference Result 50257 states and 160609 transitions. [2019-12-26 23:42:41,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:42:41,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 23:42:41,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:42,063 INFO L225 Difference]: With dead ends: 50257 [2019-12-26 23:42:42,063 INFO L226 Difference]: Without dead ends: 50244 [2019-12-26 23:42:42,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:42:42,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50244 states. [2019-12-26 23:42:43,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50244 to 37328. [2019-12-26 23:42:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-26 23:42:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-26 23:42:43,166 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-26 23:42:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:43,167 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-26 23:42:43,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:42:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-26 23:42:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:42:43,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:43,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:43,179 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:43,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:43,179 INFO L82 PathProgramCache]: Analyzing trace with hash 7812214, now seen corresponding path program 1 times [2019-12-26 23:42:43,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:43,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797851152] [2019-12-26 23:42:43,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:43,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797851152] [2019-12-26 23:42:43,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:43,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:42:43,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647034802] [2019-12-26 23:42:43,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:42:43,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:43,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:42:43,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:42:43,237 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 4 states. [2019-12-26 23:42:43,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:43,274 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-26 23:42:43,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:42:43,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:42:43,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:43,285 INFO L225 Difference]: With dead ends: 7104 [2019-12-26 23:42:43,285 INFO L226 Difference]: Without dead ends: 7104 [2019-12-26 23:42:43,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:42:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-26 23:42:43,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-26 23:42:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-26 23:42:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-26 23:42:43,372 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-26 23:42:43,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:43,373 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-26 23:42:43,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:42:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-26 23:42:43,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 23:42:43,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:43,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:43,384 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:43,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:43,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1437682904, now seen corresponding path program 1 times [2019-12-26 23:42:43,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:43,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596696611] [2019-12-26 23:42:43,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:43,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596696611] [2019-12-26 23:42:43,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:43,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:42:43,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791716608] [2019-12-26 23:42:43,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:42:43,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:43,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:42:43,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:43,466 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-26 23:42:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:43,518 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-26 23:42:43,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:42:43,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 23:42:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:43,526 INFO L225 Difference]: With dead ends: 5024 [2019-12-26 23:42:43,526 INFO L226 Difference]: Without dead ends: 5024 [2019-12-26 23:42:43,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:43,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-26 23:42:43,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-26 23:42:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-26 23:42:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-26 23:42:43,594 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-26 23:42:43,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:43,595 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-26 23:42:43,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:42:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-26 23:42:43,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:43,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:43,603 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:43,603 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:43,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:43,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2059462380, now seen corresponding path program 1 times [2019-12-26 23:42:43,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:43,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236870222] [2019-12-26 23:42:43,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:43,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236870222] [2019-12-26 23:42:43,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:43,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:42:43,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288590405] [2019-12-26 23:42:43,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:43,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:43,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:43,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:43,682 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-26 23:42:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:43,740 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-26 23:42:43,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:43,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:42:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:43,747 INFO L225 Difference]: With dead ends: 4669 [2019-12-26 23:42:43,747 INFO L226 Difference]: Without dead ends: 4669 [2019-12-26 23:42:43,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:43,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-26 23:42:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-26 23:42:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-26 23:42:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-26 23:42:43,808 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-26 23:42:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:43,808 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-26 23:42:43,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-26 23:42:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:43,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:43,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:43,815 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:43,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:43,815 INFO L82 PathProgramCache]: Analyzing trace with hash -151073877, now seen corresponding path program 1 times [2019-12-26 23:42:43,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:43,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113340218] [2019-12-26 23:42:43,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:43,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113340218] [2019-12-26 23:42:43,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:43,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:42:43,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900018269] [2019-12-26 23:42:43,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:43,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:43,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:43,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:43,905 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-26 23:42:43,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:43,966 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-26 23:42:43,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:43,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:42:43,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:43,974 INFO L225 Difference]: With dead ends: 4669 [2019-12-26 23:42:43,975 INFO L226 Difference]: Without dead ends: 4669 [2019-12-26 23:42:43,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-26 23:42:44,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-26 23:42:44,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-26 23:42:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-26 23:42:44,041 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-26 23:42:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:44,042 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-26 23:42:44,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-26 23:42:44,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:44,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:44,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:44,049 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:44,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:44,050 INFO L82 PathProgramCache]: Analyzing trace with hash -160756913, now seen corresponding path program 1 times [2019-12-26 23:42:44,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:44,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600781870] [2019-12-26 23:42:44,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:44,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600781870] [2019-12-26 23:42:44,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:44,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:42:44,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117954742] [2019-12-26 23:42:44,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:42:44,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:44,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:42:44,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:44,182 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 5 states. [2019-12-26 23:42:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:44,525 INFO L93 Difference]: Finished difference Result 7415 states and 21062 transitions. [2019-12-26 23:42:44,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:42:44,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-26 23:42:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:44,536 INFO L225 Difference]: With dead ends: 7415 [2019-12-26 23:42:44,536 INFO L226 Difference]: Without dead ends: 7415 [2019-12-26 23:42:44,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:42:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2019-12-26 23:42:44,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 5421. [2019-12-26 23:42:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-26 23:42:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 15667 transitions. [2019-12-26 23:42:44,620 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 15667 transitions. Word has length 65 [2019-12-26 23:42:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:44,621 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 15667 transitions. [2019-12-26 23:42:44,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:42:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 15667 transitions. [2019-12-26 23:42:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:44,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:44,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:44,628 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:44,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:44,628 INFO L82 PathProgramCache]: Analyzing trace with hash 947021199, now seen corresponding path program 2 times [2019-12-26 23:42:44,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:44,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057959198] [2019-12-26 23:42:44,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:44,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057959198] [2019-12-26 23:42:44,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:44,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:42:44,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873927179] [2019-12-26 23:42:44,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:42:44,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:44,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:42:44,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:42:44,745 INFO L87 Difference]: Start difference. First operand 5421 states and 15667 transitions. Second operand 6 states. [2019-12-26 23:42:45,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:45,346 INFO L93 Difference]: Finished difference Result 9148 states and 26227 transitions. [2019-12-26 23:42:45,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:42:45,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 23:42:45,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:45,358 INFO L225 Difference]: With dead ends: 9148 [2019-12-26 23:42:45,358 INFO L226 Difference]: Without dead ends: 9148 [2019-12-26 23:42:45,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:42:45,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9148 states. [2019-12-26 23:42:45,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9148 to 5923. [2019-12-26 23:42:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5923 states. [2019-12-26 23:42:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5923 states to 5923 states and 17159 transitions. [2019-12-26 23:42:45,466 INFO L78 Accepts]: Start accepts. Automaton has 5923 states and 17159 transitions. Word has length 65 [2019-12-26 23:42:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:45,466 INFO L462 AbstractCegarLoop]: Abstraction has 5923 states and 17159 transitions. [2019-12-26 23:42:45,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:42:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 5923 states and 17159 transitions. [2019-12-26 23:42:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:42:45,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:45,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:45,475 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:45,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:45,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1073447055, now seen corresponding path program 3 times [2019-12-26 23:42:45,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:45,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017707109] [2019-12-26 23:42:45,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:45,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017707109] [2019-12-26 23:42:45,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:45,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:45,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818254006] [2019-12-26 23:42:45,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:45,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:45,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:45,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:45,554 INFO L87 Difference]: Start difference. First operand 5923 states and 17159 transitions. Second operand 3 states. [2019-12-26 23:42:45,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:45,586 INFO L93 Difference]: Finished difference Result 5089 states and 14464 transitions. [2019-12-26 23:42:45,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:45,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:42:45,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:45,595 INFO L225 Difference]: With dead ends: 5089 [2019-12-26 23:42:45,595 INFO L226 Difference]: Without dead ends: 5089 [2019-12-26 23:42:45,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5089 states. [2019-12-26 23:42:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5089 to 4949. [2019-12-26 23:42:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4949 states. [2019-12-26 23:42:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 14078 transitions. [2019-12-26 23:42:45,733 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 14078 transitions. Word has length 65 [2019-12-26 23:42:45,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:45,734 INFO L462 AbstractCegarLoop]: Abstraction has 4949 states and 14078 transitions. [2019-12-26 23:42:45,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 14078 transitions. [2019-12-26 23:42:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:42:45,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:45,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:45,748 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:45,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:45,748 INFO L82 PathProgramCache]: Analyzing trace with hash -924926265, now seen corresponding path program 1 times [2019-12-26 23:42:45,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:45,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635655081] [2019-12-26 23:42:45,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:46,129 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-26 23:42:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:46,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635655081] [2019-12-26 23:42:46,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:46,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:42:46,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243414172] [2019-12-26 23:42:46,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:42:46,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:46,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:42:46,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:46,185 INFO L87 Difference]: Start difference. First operand 4949 states and 14078 transitions. Second operand 5 states. [2019-12-26 23:42:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:46,485 INFO L93 Difference]: Finished difference Result 7463 states and 21088 transitions. [2019-12-26 23:42:46,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:42:46,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-26 23:42:46,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:46,498 INFO L225 Difference]: With dead ends: 7463 [2019-12-26 23:42:46,498 INFO L226 Difference]: Without dead ends: 7463 [2019-12-26 23:42:46,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:42:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2019-12-26 23:42:46,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 6154. [2019-12-26 23:42:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6154 states. [2019-12-26 23:42:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6154 states to 6154 states and 17545 transitions. [2019-12-26 23:42:46,611 INFO L78 Accepts]: Start accepts. Automaton has 6154 states and 17545 transitions. Word has length 66 [2019-12-26 23:42:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:46,611 INFO L462 AbstractCegarLoop]: Abstraction has 6154 states and 17545 transitions. [2019-12-26 23:42:46,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:42:46,611 INFO L276 IsEmpty]: Start isEmpty. Operand 6154 states and 17545 transitions. [2019-12-26 23:42:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:42:46,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:46,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:46,620 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:46,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:46,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1368765211, now seen corresponding path program 2 times [2019-12-26 23:42:46,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:46,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207394780] [2019-12-26 23:42:46,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:46,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207394780] [2019-12-26 23:42:46,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:46,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:42:46,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187162219] [2019-12-26 23:42:46,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:42:46,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:46,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:42:46,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:42:46,804 INFO L87 Difference]: Start difference. First operand 6154 states and 17545 transitions. Second operand 9 states. [2019-12-26 23:42:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:47,708 INFO L93 Difference]: Finished difference Result 8873 states and 24903 transitions. [2019-12-26 23:42:47,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:42:47,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 23:42:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:47,721 INFO L225 Difference]: With dead ends: 8873 [2019-12-26 23:42:47,721 INFO L226 Difference]: Without dead ends: 8873 [2019-12-26 23:42:47,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-12-26 23:42:47,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8873 states. [2019-12-26 23:42:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8873 to 6441. [2019-12-26 23:42:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6441 states. [2019-12-26 23:42:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6441 states to 6441 states and 18335 transitions. [2019-12-26 23:42:47,825 INFO L78 Accepts]: Start accepts. Automaton has 6441 states and 18335 transitions. Word has length 66 [2019-12-26 23:42:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:47,825 INFO L462 AbstractCegarLoop]: Abstraction has 6441 states and 18335 transitions. [2019-12-26 23:42:47,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:42:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 18335 transitions. [2019-12-26 23:42:47,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:42:47,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:47,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:47,834 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:47,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:47,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1762090943, now seen corresponding path program 3 times [2019-12-26 23:42:47,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:47,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801911897] [2019-12-26 23:42:47,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:48,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801911897] [2019-12-26 23:42:48,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:48,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:42:48,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288351852] [2019-12-26 23:42:48,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:42:48,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:48,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:42:48,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:42:48,083 INFO L87 Difference]: Start difference. First operand 6441 states and 18335 transitions. Second operand 10 states. [2019-12-26 23:42:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:49,124 INFO L93 Difference]: Finished difference Result 10248 states and 28486 transitions. [2019-12-26 23:42:49,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:42:49,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 23:42:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:49,138 INFO L225 Difference]: With dead ends: 10248 [2019-12-26 23:42:49,138 INFO L226 Difference]: Without dead ends: 10248 [2019-12-26 23:42:49,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:42:49,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10248 states. [2019-12-26 23:42:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10248 to 6273. [2019-12-26 23:42:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6273 states. [2019-12-26 23:42:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6273 states to 6273 states and 17695 transitions. [2019-12-26 23:42:49,250 INFO L78 Accepts]: Start accepts. Automaton has 6273 states and 17695 transitions. Word has length 66 [2019-12-26 23:42:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:49,251 INFO L462 AbstractCegarLoop]: Abstraction has 6273 states and 17695 transitions. [2019-12-26 23:42:49,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:42:49,251 INFO L276 IsEmpty]: Start isEmpty. Operand 6273 states and 17695 transitions. [2019-12-26 23:42:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:42:49,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:49,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:49,260 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:49,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:49,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1098709733, now seen corresponding path program 4 times [2019-12-26 23:42:49,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:49,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933136089] [2019-12-26 23:42:49,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:49,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933136089] [2019-12-26 23:42:49,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:49,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:49,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055322339] [2019-12-26 23:42:49,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:49,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:49,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:49,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:49,331 INFO L87 Difference]: Start difference. First operand 6273 states and 17695 transitions. Second operand 3 states. [2019-12-26 23:42:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:49,399 INFO L93 Difference]: Finished difference Result 6273 states and 17694 transitions. [2019-12-26 23:42:49,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:49,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:42:49,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:49,410 INFO L225 Difference]: With dead ends: 6273 [2019-12-26 23:42:49,410 INFO L226 Difference]: Without dead ends: 6273 [2019-12-26 23:42:49,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:49,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6273 states. [2019-12-26 23:42:49,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6273 to 3891. [2019-12-26 23:42:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3891 states. [2019-12-26 23:42:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3891 states to 3891 states and 11117 transitions. [2019-12-26 23:42:49,520 INFO L78 Accepts]: Start accepts. Automaton has 3891 states and 11117 transitions. Word has length 66 [2019-12-26 23:42:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:49,521 INFO L462 AbstractCegarLoop]: Abstraction has 3891 states and 11117 transitions. [2019-12-26 23:42:49,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3891 states and 11117 transitions. [2019-12-26 23:42:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:42:49,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:49,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:49,528 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:49,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:49,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1906146231, now seen corresponding path program 1 times [2019-12-26 23:42:49,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:49,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195519904] [2019-12-26 23:42:49,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:49,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195519904] [2019-12-26 23:42:49,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:49,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:42:49,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513903187] [2019-12-26 23:42:49,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:42:49,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:49,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:42:49,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:42:49,686 INFO L87 Difference]: Start difference. First operand 3891 states and 11117 transitions. Second operand 7 states. [2019-12-26 23:42:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:49,785 INFO L93 Difference]: Finished difference Result 7081 states and 20328 transitions. [2019-12-26 23:42:49,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:42:49,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-26 23:42:49,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:49,793 INFO L225 Difference]: With dead ends: 7081 [2019-12-26 23:42:49,793 INFO L226 Difference]: Without dead ends: 4098 [2019-12-26 23:42:49,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:42:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-12-26 23:42:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3206. [2019-12-26 23:42:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3206 states. [2019-12-26 23:42:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 3206 states and 9108 transitions. [2019-12-26 23:42:49,843 INFO L78 Accepts]: Start accepts. Automaton has 3206 states and 9108 transitions. Word has length 67 [2019-12-26 23:42:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:49,843 INFO L462 AbstractCegarLoop]: Abstraction has 3206 states and 9108 transitions. [2019-12-26 23:42:49,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:42:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 9108 transitions. [2019-12-26 23:42:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:42:49,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:49,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:49,847 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:49,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:49,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1418245853, now seen corresponding path program 2 times [2019-12-26 23:42:49,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:49,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946751803] [2019-12-26 23:42:49,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:49,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-26 23:42:49,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946751803] [2019-12-26 23:42:49,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:49,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:42:49,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709615791] [2019-12-26 23:42:49,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:42:49,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:49,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:42:49,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:42:49,947 INFO L87 Difference]: Start difference. First operand 3206 states and 9108 transitions. Second operand 5 states. [2019-12-26 23:42:50,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:50,007 INFO L93 Difference]: Finished difference Result 5114 states and 14457 transitions. [2019-12-26 23:42:50,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:42:50,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-26 23:42:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:50,011 INFO L225 Difference]: With dead ends: 5114 [2019-12-26 23:42:50,011 INFO L226 Difference]: Without dead ends: 2095 [2019-12-26 23:42:50,012 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-26 23:42:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2019-12-26 23:42:50,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 2095. [2019-12-26 23:42:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2095 states. [2019-12-26 23:42:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 5845 transitions. [2019-12-26 23:42:50,225 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 5845 transitions. Word has length 67 [2019-12-26 23:42:50,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:50,225 INFO L462 AbstractCegarLoop]: Abstraction has 2095 states and 5845 transitions. [2019-12-26 23:42:50,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:42:50,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 5845 transitions. [2019-12-26 23:42:50,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:42:50,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:50,228 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:50,229 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:50,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:50,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1668809625, now seen corresponding path program 3 times [2019-12-26 23:42:50,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:50,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404866429] [2019-12-26 23:42:50,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:42:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:42:50,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404866429] [2019-12-26 23:42:50,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:42:50,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:42:50,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948915134] [2019-12-26 23:42:50,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:42:50,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:42:50,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:42:50,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:50,276 INFO L87 Difference]: Start difference. First operand 2095 states and 5845 transitions. Second operand 3 states. [2019-12-26 23:42:50,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:42:50,292 INFO L93 Difference]: Finished difference Result 1834 states and 5015 transitions. [2019-12-26 23:42:50,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:42:50,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 23:42:50,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:42:50,295 INFO L225 Difference]: With dead ends: 1834 [2019-12-26 23:42:50,295 INFO L226 Difference]: Without dead ends: 1834 [2019-12-26 23:42:50,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:42:50,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2019-12-26 23:42:50,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1792. [2019-12-26 23:42:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2019-12-26 23:42:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 4902 transitions. [2019-12-26 23:42:50,330 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 4902 transitions. Word has length 67 [2019-12-26 23:42:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:42:50,330 INFO L462 AbstractCegarLoop]: Abstraction has 1792 states and 4902 transitions. [2019-12-26 23:42:50,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:42:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 4902 transitions. [2019-12-26 23:42:50,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 23:42:50,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:42:50,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:42:50,333 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:42:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:42:50,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1093105687, now seen corresponding path program 1 times [2019-12-26 23:42:50,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:42:50,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898316237] [2019-12-26 23:42:50,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:42:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:42:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:42:50,474 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:42:50,475 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:42:50,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2028~0.base_21| 4)) (= 0 v_~x$w_buff0_used~0_815) (= v_~x$r_buff0_thd1~0_121 0) (= v_~x$flush_delayed~0_33 0) (= v_~y~0_122 0) (= 0 v_~x$r_buff0_thd3~0_131) (= 0 |v_ULTIMATE.start_main_~#t2028~0.offset_18|) (= 0 v_~x$r_buff1_thd3~0_199) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$r_buff1_thd2~0_200) (= v_~weak$$choice2~0_113 0) (= v_~z~0_31 0) (= v_~main$tmp_guard1~0_21 0) (= 0 v_~x$w_buff1~0_221) (= 0 v_~weak$$choice0~0_15) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_15|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2028~0.base_21|) 0) (= v_~x$r_buff0_thd0~0_372 0) (= 0 v_~x~0_181) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_cnt~0_156 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$r_buff0_thd2~0_212) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2028~0.base_21| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2028~0.base_21|) |v_ULTIMATE.start_main_~#t2028~0.offset_18| 0))) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_4| 0) (= v_~x$r_buff1_thd1~0_184 0) (= v_~x$r_buff1_thd0~0_296 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2028~0.base_21| 1)) (= 0 v_~__unbuffered_p2_EAX~0_22) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2028~0.base_21|) (= 0 v_~x$w_buff0~0_269))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_22|, ~x$w_buff0~0=v_~x$w_buff0~0_269, ULTIMATE.start_main_~#t2029~0.base=|v_ULTIMATE.start_main_~#t2029~0.base_22|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_30|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_30|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_46|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_184, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_131, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_33|, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start_main_~#t2029~0.offset=|v_ULTIMATE.start_main_~#t2029~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_43|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_200, ULTIMATE.start_main_~#t2028~0.base=|v_ULTIMATE.start_main_~#t2028~0.base_21|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_112|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_181, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_121, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_22|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_32|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_30|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_118|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_18|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_26|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_51|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_32|, ~y~0=v_~y~0_122, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_24|, ULTIMATE.start_main_~#t2030~0.base=|v_ULTIMATE.start_main_~#t2030~0.base_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_~#t2030~0.offset=|v_ULTIMATE.start_main_~#t2030~0.offset_17|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_~#t2028~0.offset=|v_ULTIMATE.start_main_~#t2028~0.offset_18|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_296, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_212, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_60|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_815, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_33|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_113, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_~#t2029~0.base, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2029~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2028~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t2030~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t2030~0.offset, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2028~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:42:50,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L805-1-->L807: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2029~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2029~0.base_13|) |v_ULTIMATE.start_main_~#t2029~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2029~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2029~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2029~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2029~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2029~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2029~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2029~0.base=|v_ULTIMATE.start_main_~#t2029~0.base_13|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2029~0.offset=|v_ULTIMATE.start_main_~#t2029~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2029~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2029~0.offset] because there is no mapped edge [2019-12-26 23:42:50,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= 2 v_~x$w_buff0~0_30) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= v_~x$w_buff0~0_31 v_~x$w_buff1~0_21) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_30, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 23:42:50,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2030~0.base_9| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t2030~0.offset_8| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2030~0.base_9| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2030~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2030~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2030~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2030~0.base_9|) |v_ULTIMATE.start_main_~#t2030~0.offset_8| 2))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2030~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2030~0.base=|v_ULTIMATE.start_main_~#t2030~0.base_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2030~0.offset=|v_ULTIMATE.start_main_~#t2030~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2030~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2030~0.offset, #length] because there is no mapped edge [2019-12-26 23:42:50,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L782-2-->L782-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1547074609 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1547074609 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-1547074609 |P2Thread1of1ForFork2_#t~ite15_Out-1547074609|)) (and (not .cse0) (= ~x$w_buff1~0_In-1547074609 |P2Thread1of1ForFork2_#t~ite15_Out-1547074609|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1547074609, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1547074609, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1547074609, ~x~0=~x~0_In-1547074609} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1547074609|, ~x$w_buff1~0=~x$w_buff1~0_In-1547074609, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1547074609, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1547074609, ~x~0=~x~0_In-1547074609} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 23:42:50,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-26 23:42:50,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In658736933 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In658736933 256)))) (or (and (= ~x$w_buff0_used~0_In658736933 |P2Thread1of1ForFork2_#t~ite17_Out658736933|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out658736933|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In658736933, ~x$w_buff0_used~0=~x$w_buff0_used~0_In658736933} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In658736933, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out658736933|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In658736933} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:42:50,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L784-->L784-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In318850811 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In318850811 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In318850811 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In318850811 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In318850811 |P2Thread1of1ForFork2_#t~ite18_Out318850811|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out318850811| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In318850811, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In318850811, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In318850811, ~x$w_buff0_used~0=~x$w_buff0_used~0_In318850811} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In318850811, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In318850811, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In318850811, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out318850811|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In318850811} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 23:42:50,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1350851755 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1350851755 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In-1350851755 |P2Thread1of1ForFork2_#t~ite19_Out-1350851755|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-1350851755| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1350851755, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1350851755} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1350851755, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1350851755|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1350851755} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 23:42:50,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In491560409 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In491560409 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In491560409 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In491560409 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out491560409| 0)) (and (= ~x$r_buff1_thd3~0_In491560409 |P2Thread1of1ForFork2_#t~ite20_Out491560409|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In491560409, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In491560409, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In491560409, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491560409} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out491560409|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In491560409, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In491560409, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In491560409, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491560409} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 23:42:50,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_56| v_~x$r_buff1_thd3~0_147) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_55|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:42:50,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L733-2-->L733-5: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In882274476 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In882274476 256))) (.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out882274476| |P0Thread1of1ForFork0_#t~ite3_Out882274476|))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out882274476| ~x$w_buff1~0_In882274476) .cse0 (not .cse1) (not .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out882274476| ~x~0_In882274476) (or .cse2 .cse1) .cse0))) InVars {~x$w_buff1~0=~x$w_buff1~0_In882274476, ~x$w_buff1_used~0=~x$w_buff1_used~0_In882274476, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In882274476, ~x~0=~x~0_In882274476} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out882274476|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out882274476|, ~x$w_buff1~0=~x$w_buff1~0_In882274476, ~x$w_buff1_used~0=~x$w_buff1_used~0_In882274476, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In882274476, ~x~0=~x~0_In882274476} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 23:42:50,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In571042041 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In571042041 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out571042041|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In571042041 |P0Thread1of1ForFork0_#t~ite5_Out571042041|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In571042041, ~x$w_buff0_used~0=~x$w_buff0_used~0_In571042041} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out571042041|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In571042041, ~x$w_buff0_used~0=~x$w_buff0_used~0_In571042041} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:42:50,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1357240519 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In1357240519 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1357240519 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1357240519 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1357240519| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out1357240519| ~x$w_buff1_used~0_In1357240519)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1357240519, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1357240519, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1357240519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1357240519} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1357240519|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1357240519, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1357240519, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1357240519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1357240519} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:42:50,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In363429449 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In363429449 256)))) (or (and (= ~x$r_buff0_thd1~0_In363429449 |P0Thread1of1ForFork0_#t~ite7_Out363429449|) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out363429449| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In363429449, ~x$w_buff0_used~0=~x$w_buff0_used~0_In363429449} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In363429449, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out363429449|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In363429449} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:42:50,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1429106691 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-1429106691 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1429106691 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1429106691 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1429106691|)) (and (= ~x$r_buff1_thd1~0_In-1429106691 |P0Thread1of1ForFork0_#t~ite8_Out-1429106691|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1429106691, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1429106691, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1429106691, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1429106691} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1429106691, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1429106691|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1429106691, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1429106691, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1429106691} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:42:50,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_126 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_126} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-26 23:42:50,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1008432047 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1008432047 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1008432047|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-1008432047| ~x$w_buff0_used~0_In-1008432047)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1008432047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1008432047} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1008432047|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1008432047, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1008432047} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:42:50,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L764-->L764-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1303442923 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1303442923 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1303442923 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1303442923 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out-1303442923| 0)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1303442923| ~x$w_buff1_used~0_In-1303442923) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1303442923, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1303442923, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1303442923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1303442923} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1303442923, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1303442923, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1303442923|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1303442923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1303442923} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:42:50,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L765-->L766: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In518695368 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In518695368 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out518695368) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In518695368 ~x$r_buff0_thd2~0_Out518695368) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In518695368, ~x$w_buff0_used~0=~x$w_buff0_used~0_In518695368} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out518695368|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out518695368, ~x$w_buff0_used~0=~x$w_buff0_used~0_In518695368} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:42:50,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1676636428 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1676636428 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1676636428 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1676636428 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1676636428| ~x$r_buff1_thd2~0_In1676636428) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite14_Out1676636428| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1676636428, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1676636428, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1676636428, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1676636428} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1676636428, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1676636428, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1676636428, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1676636428|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1676636428} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:42:50,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_154 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_154, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:42:50,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:42:50,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L815-2-->L815-5: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-385028415 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-385028415 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite25_Out-385028415| |ULTIMATE.start_main_#t~ite24_Out-385028415|))) (or (and (= ~x$w_buff1~0_In-385028415 |ULTIMATE.start_main_#t~ite24_Out-385028415|) (not .cse0) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~x~0_In-385028415 |ULTIMATE.start_main_#t~ite24_Out-385028415|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-385028415, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-385028415, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-385028415, ~x~0=~x~0_In-385028415} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-385028415, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-385028415|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-385028415|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-385028415, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-385028415, ~x~0=~x~0_In-385028415} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-26 23:42:50,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1836648363 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1836648363 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1836648363 |ULTIMATE.start_main_#t~ite26_Out-1836648363|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-1836648363| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1836648363, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1836648363} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1836648363, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1836648363|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1836648363} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 23:42:50,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In-862266749 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-862266749 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-862266749 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-862266749 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out-862266749| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-862266749 |ULTIMATE.start_main_#t~ite27_Out-862266749|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-862266749, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-862266749, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-862266749, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-862266749} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-862266749, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-862266749, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-862266749|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-862266749, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-862266749} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 23:42:50,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-597995583 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-597995583 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-597995583 |ULTIMATE.start_main_#t~ite28_Out-597995583|)) (and (= |ULTIMATE.start_main_#t~ite28_Out-597995583| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-597995583, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-597995583} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-597995583, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-597995583|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-597995583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 23:42:50,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-277529539 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-277529539 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-277529539 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-277529539 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite29_Out-277529539| ~x$r_buff1_thd0~0_In-277529539) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite29_Out-277529539| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-277529539, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-277529539, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-277529539, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-277529539} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-277529539, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-277529539|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-277529539, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-277529539, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-277529539} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 23:42:50,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_111 v_~x$r_buff0_thd0~0_110) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:42:50,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= v_~x$mem_tmp~0_12 v_~x~0_151) (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_12} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_12, ~x~0=v_~x~0_151, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:42:50,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:42:50,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:42:50 BasicIcfg [2019-12-26 23:42:50,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:42:50,673 INFO L168 Benchmark]: Toolchain (without parser) took 87168.28 ms. Allocated memory was 144.7 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-26 23:42:50,675 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 23:42:50,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.06 ms. Allocated memory was 144.7 MB in the beginning and 200.3 MB in the end (delta: 55.6 MB). Free memory was 100.7 MB in the beginning and 152.0 MB in the end (delta: -51.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:42:50,681 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.83 ms. Allocated memory is still 200.3 MB. Free memory was 152.0 MB in the beginning and 148.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:42:50,682 INFO L168 Benchmark]: Boogie Preprocessor took 38.23 ms. Allocated memory is still 200.3 MB. Free memory was 148.6 MB in the beginning and 146.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:42:50,683 INFO L168 Benchmark]: RCFGBuilder took 847.72 ms. Allocated memory is still 200.3 MB. Free memory was 146.5 MB in the beginning and 96.3 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:42:50,684 INFO L168 Benchmark]: TraceAbstraction took 85420.63 ms. Allocated memory was 200.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 95.6 MB in the beginning and 2.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-26 23:42:50,690 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.47 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.06 ms. Allocated memory was 144.7 MB in the beginning and 200.3 MB in the end (delta: 55.6 MB). Free memory was 100.7 MB in the beginning and 152.0 MB in the end (delta: -51.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.83 ms. Allocated memory is still 200.3 MB. Free memory was 152.0 MB in the beginning and 148.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.23 ms. Allocated memory is still 200.3 MB. Free memory was 148.6 MB in the beginning and 146.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.72 ms. Allocated memory is still 200.3 MB. Free memory was 146.5 MB in the beginning and 96.3 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 85420.63 ms. Allocated memory was 200.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 95.6 MB in the beginning and 2.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 29 ChoiceCompositions, 6170 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 77 SemBasedMoverChecksPositive, 248 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 87419 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2028, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L809] FCALL, FORK 0 pthread_create(&t2030, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L727] 1 z = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 85.0s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2794 SDtfs, 2403 SDslu, 5099 SDs, 0 SdLazy, 3497 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 28 SyntacticMatches, 19 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 38.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 80055 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 981 NumberOfCodeBlocks, 981 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 894 ConstructedInterpolants, 0 QuantifiedInterpolants, 147305 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...