/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:59:41,196 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:59:41,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:59:41,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:59:41,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:59:41,222 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:59:41,224 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:59:41,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:59:41,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:59:41,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:59:41,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:59:41,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:59:41,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:59:41,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:59:41,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:59:41,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:59:41,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:59:41,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:59:41,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:59:41,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:59:41,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:59:41,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:59:41,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:59:41,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:59:41,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:59:41,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:59:41,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:59:41,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:59:41,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:59:41,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:59:41,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:59:41,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:59:41,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:59:41,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:59:41,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:59:41,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:59:41,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:59:41,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:59:41,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:59:41,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:59:41,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:59:41,289 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:59:41,317 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:59:41,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:59:41,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:59:41,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:59:41,321 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:59:41,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:59:41,323 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:59:41,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:59:41,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:59:41,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:59:41,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:59:41,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:59:41,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:59:41,325 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:59:41,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:59:41,325 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:59:41,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:59:41,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:59:41,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:59:41,326 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:59:41,326 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:59:41,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:59:41,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:59:41,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:59:41,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:59:41,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:59:41,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:59:41,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:59:41,329 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:59:41,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:59:41,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:59:41,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:59:41,632 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:59:41,632 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:59:41,633 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2019-12-27 02:59:41,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c9a75310/66af191e67a04ac8aed27894f80b3f4c/FLAG0f209fc8b [2019-12-27 02:59:42,266 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:59:42,267 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.opt.i [2019-12-27 02:59:42,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c9a75310/66af191e67a04ac8aed27894f80b3f4c/FLAG0f209fc8b [2019-12-27 02:59:42,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c9a75310/66af191e67a04ac8aed27894f80b3f4c [2019-12-27 02:59:42,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:59:42,533 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:59:42,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:59:42,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:59:42,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:59:42,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:59:42" (1/1) ... [2019-12-27 02:59:42,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5e2723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:42, skipping insertion in model container [2019-12-27 02:59:42,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:59:42" (1/1) ... [2019-12-27 02:59:42,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:59:42,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:59:43,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:59:43,147 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:59:43,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:59:43,326 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:59:43,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:43 WrapperNode [2019-12-27 02:59:43,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:59:43,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:59:43,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:59:43,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:59:43,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:43" (1/1) ... [2019-12-27 02:59:43,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:43" (1/1) ... [2019-12-27 02:59:43,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:59:43,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:59:43,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:59:43,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:59:43,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:43" (1/1) ... [2019-12-27 02:59:43,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:43" (1/1) ... [2019-12-27 02:59:43,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:43" (1/1) ... [2019-12-27 02:59:43,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:43" (1/1) ... [2019-12-27 02:59:43,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:43" (1/1) ... [2019-12-27 02:59:43,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:43" (1/1) ... [2019-12-27 02:59:43,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:43" (1/1) ... [2019-12-27 02:59:43,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:59:43,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:59:43,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:59:43,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:59:43,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:59:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:59:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:59:43,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:59:43,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:59:43,497 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:59:43,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:59:43,497 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:59:43,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:59:43,497 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:59:43,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:59:43,498 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:59:43,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:59:43,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:59:43,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:59:43,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:59:43,500 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:59:44,252 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:59:44,253 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:59:44,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:59:44 BoogieIcfgContainer [2019-12-27 02:59:44,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:59:44,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:59:44,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:59:44,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:59:44,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:59:42" (1/3) ... [2019-12-27 02:59:44,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52948b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:59:44, skipping insertion in model container [2019-12-27 02:59:44,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:59:43" (2/3) ... [2019-12-27 02:59:44,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52948b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:59:44, skipping insertion in model container [2019-12-27 02:59:44,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:59:44" (3/3) ... [2019-12-27 02:59:44,262 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_tso.opt.i [2019-12-27 02:59:44,272 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:59:44,272 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:59:44,281 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:59:44,282 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:59:44,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,321 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,322 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,323 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,324 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,325 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,326 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,334 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,334 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,334 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,334 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,335 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,335 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,335 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,335 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,336 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,336 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,336 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,357 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,358 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,359 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,363 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,363 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,366 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,367 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,372 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,372 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,374 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,375 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,375 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,375 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,375 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,375 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,376 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,376 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,376 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,376 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,376 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,377 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:59:44,391 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:59:44,412 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:59:44,413 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:59:44,413 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:59:44,413 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:59:44,413 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:59:44,413 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:59:44,414 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:59:44,414 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:59:44,432 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 207 transitions [2019-12-27 02:59:44,434 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-27 02:59:44,532 INFO L132 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-27 02:59:44,532 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:59:44,547 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 02:59:44,568 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-27 02:59:44,619 INFO L132 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-27 02:59:44,619 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:59:44,626 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 02:59:44,641 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 02:59:44,643 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:59:49,631 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 02:59:49,781 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 02:59:49,802 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50860 [2019-12-27 02:59:49,802 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 02:59:49,806 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 97 transitions [2019-12-27 02:59:52,571 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-27 02:59:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-27 02:59:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:59:52,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:59:52,581 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:59:52,582 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:59:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:59:52,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1893967926, now seen corresponding path program 1 times [2019-12-27 02:59:52,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:59:52,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5873390] [2019-12-27 02:59:52,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:59:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:59:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:59:52,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5873390] [2019-12-27 02:59:52,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:59:52,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:59:52,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624619335] [2019-12-27 02:59:52,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:59:52,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:59:52,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:59:52,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:59:52,932 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-27 02:59:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:59:53,635 INFO L93 Difference]: Finished difference Result 34366 states and 145832 transitions. [2019-12-27 02:59:53,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:59:53,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:59:53,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:59:54,171 INFO L225 Difference]: With dead ends: 34366 [2019-12-27 02:59:54,171 INFO L226 Difference]: Without dead ends: 33694 [2019-12-27 02:59:54,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:59:54,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33694 states. [2019-12-27 02:59:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33694 to 33694. [2019-12-27 02:59:55,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33694 states. [2019-12-27 02:59:57,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 143088 transitions. [2019-12-27 02:59:57,854 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 143088 transitions. Word has length 9 [2019-12-27 02:59:57,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:59:57,855 INFO L462 AbstractCegarLoop]: Abstraction has 33694 states and 143088 transitions. [2019-12-27 02:59:57,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:59:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 143088 transitions. [2019-12-27 02:59:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:59:57,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:59:57,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:59:57,871 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:59:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:59:57,873 INFO L82 PathProgramCache]: Analyzing trace with hash 706074371, now seen corresponding path program 1 times [2019-12-27 02:59:57,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:59:57,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65175774] [2019-12-27 02:59:57,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:59:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:59:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:59:58,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65175774] [2019-12-27 02:59:58,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:59:58,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:59:58,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064040680] [2019-12-27 02:59:58,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:59:58,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:59:58,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:59:58,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:59:58,052 INFO L87 Difference]: Start difference. First operand 33694 states and 143088 transitions. Second operand 4 states. [2019-12-27 02:59:58,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:59:58,978 INFO L93 Difference]: Finished difference Result 52350 states and 214840 transitions. [2019-12-27 02:59:58,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:59:58,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:59:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:59:59,634 INFO L225 Difference]: With dead ends: 52350 [2019-12-27 02:59:59,634 INFO L226 Difference]: Without dead ends: 52322 [2019-12-27 02:59:59,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-27 03:00:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47546. [2019-12-27 03:00:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47546 states. [2019-12-27 03:00:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47546 states to 47546 states and 197076 transitions. [2019-12-27 03:00:04,081 INFO L78 Accepts]: Start accepts. Automaton has 47546 states and 197076 transitions. Word has length 15 [2019-12-27 03:00:04,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:04,081 INFO L462 AbstractCegarLoop]: Abstraction has 47546 states and 197076 transitions. [2019-12-27 03:00:04,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:00:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 47546 states and 197076 transitions. [2019-12-27 03:00:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 03:00:04,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:04,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:04,085 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:04,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1899832342, now seen corresponding path program 1 times [2019-12-27 03:00:04,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:04,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771441160] [2019-12-27 03:00:04,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:04,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-27 03:00:04,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771441160] [2019-12-27 03:00:04,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:04,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:04,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539103767] [2019-12-27 03:00:04,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:00:04,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:04,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:00:04,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:00:04,178 INFO L87 Difference]: Start difference. First operand 47546 states and 197076 transitions. Second operand 4 states. [2019-12-27 03:00:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:04,645 INFO L93 Difference]: Finished difference Result 58566 states and 240916 transitions. [2019-12-27 03:00:04,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:00:04,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 03:00:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:05,463 INFO L225 Difference]: With dead ends: 58566 [2019-12-27 03:00:05,464 INFO L226 Difference]: Without dead ends: 58566 [2019-12-27 03:00:05,464 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-27 03:00:05,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58566 states. [2019-12-27 03:00:08,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58566 to 52262. [2019-12-27 03:00:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52262 states. [2019-12-27 03:00:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52262 states to 52262 states and 216300 transitions. [2019-12-27 03:00:09,086 INFO L78 Accepts]: Start accepts. Automaton has 52262 states and 216300 transitions. Word has length 15 [2019-12-27 03:00:09,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:09,086 INFO L462 AbstractCegarLoop]: Abstraction has 52262 states and 216300 transitions. [2019-12-27 03:00:09,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:00:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 52262 states and 216300 transitions. [2019-12-27 03:00:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 03:00:09,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:09,101 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] [2019-12-27 03:00:09,102 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:09,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:09,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1099673125, now seen corresponding path program 1 times [2019-12-27 03:00:09,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:09,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704285415] [2019-12-27 03:00:09,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:09,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-27 03:00:09,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704285415] [2019-12-27 03:00:09,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:09,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:00:09,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096142198] [2019-12-27 03:00:09,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:00:09,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:09,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:00:09,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:09,182 INFO L87 Difference]: Start difference. First operand 52262 states and 216300 transitions. Second operand 5 states. [2019-12-27 03:00:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:10,371 INFO L93 Difference]: Finished difference Result 69742 states and 283816 transitions. [2019-12-27 03:00:10,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:00:10,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 03:00:10,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:10,580 INFO L225 Difference]: With dead ends: 69742 [2019-12-27 03:00:10,581 INFO L226 Difference]: Without dead ends: 69714 [2019-12-27 03:00:10,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:00:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69714 states. [2019-12-27 03:00:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69714 to 52322. [2019-12-27 03:00:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52322 states. [2019-12-27 03:00:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52322 states to 52322 states and 216080 transitions. [2019-12-27 03:00:14,476 INFO L78 Accepts]: Start accepts. Automaton has 52322 states and 216080 transitions. Word has length 21 [2019-12-27 03:00:14,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:14,476 INFO L462 AbstractCegarLoop]: Abstraction has 52322 states and 216080 transitions. [2019-12-27 03:00:14,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:00:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 52322 states and 216080 transitions. [2019-12-27 03:00:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 03:00:14,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:14,539 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] [2019-12-27 03:00:14,539 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:14,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:14,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2069453955, now seen corresponding path program 1 times [2019-12-27 03:00:14,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:14,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032436879] [2019-12-27 03:00:14,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:14,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032436879] [2019-12-27 03:00:14,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:14,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:00:14,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930477373] [2019-12-27 03:00:14,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:14,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:14,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:14,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:14,631 INFO L87 Difference]: Start difference. First operand 52322 states and 216080 transitions. Second operand 3 states. [2019-12-27 03:00:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:14,988 INFO L93 Difference]: Finished difference Result 66242 states and 270896 transitions. [2019-12-27 03:00:14,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:14,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 03:00:14,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:15,159 INFO L225 Difference]: With dead ends: 66242 [2019-12-27 03:00:15,159 INFO L226 Difference]: Without dead ends: 66242 [2019-12-27 03:00:15,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66242 states. [2019-12-27 03:00:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66242 to 57682. [2019-12-27 03:00:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57682 states. [2019-12-27 03:00:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57682 states to 57682 states and 237656 transitions. [2019-12-27 03:00:20,384 INFO L78 Accepts]: Start accepts. Automaton has 57682 states and 237656 transitions. Word has length 29 [2019-12-27 03:00:20,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:20,385 INFO L462 AbstractCegarLoop]: Abstraction has 57682 states and 237656 transitions. [2019-12-27 03:00:20,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:20,385 INFO L276 IsEmpty]: Start isEmpty. Operand 57682 states and 237656 transitions. [2019-12-27 03:00:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 03:00:20,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:20,427 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] [2019-12-27 03:00:20,427 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:20,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:20,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2069217239, now seen corresponding path program 1 times [2019-12-27 03:00:20,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:20,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851544192] [2019-12-27 03:00:20,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:20,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851544192] [2019-12-27 03:00:20,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:20,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:00:20,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747889074] [2019-12-27 03:00:20,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:00:20,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:20,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:00:20,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:00:20,530 INFO L87 Difference]: Start difference. First operand 57682 states and 237656 transitions. Second operand 4 states. [2019-12-27 03:00:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:20,749 INFO L93 Difference]: Finished difference Result 46417 states and 175864 transitions. [2019-12-27 03:00:20,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:00:20,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-27 03:00:20,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:20,847 INFO L225 Difference]: With dead ends: 46417 [2019-12-27 03:00:20,847 INFO L226 Difference]: Without dead ends: 45309 [2019-12-27 03:00:20,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45309 states. [2019-12-27 03:00:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45309 to 45309. [2019-12-27 03:00:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45309 states. [2019-12-27 03:00:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45309 states to 45309 states and 172388 transitions. [2019-12-27 03:00:22,015 INFO L78 Accepts]: Start accepts. Automaton has 45309 states and 172388 transitions. Word has length 29 [2019-12-27 03:00:22,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:22,015 INFO L462 AbstractCegarLoop]: Abstraction has 45309 states and 172388 transitions. [2019-12-27 03:00:22,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:00:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 45309 states and 172388 transitions. [2019-12-27 03:00:22,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 03:00:22,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:22,044 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] [2019-12-27 03:00:22,044 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:22,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:22,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2027793723, now seen corresponding path program 1 times [2019-12-27 03:00:22,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:22,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212884480] [2019-12-27 03:00:22,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:22,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212884480] [2019-12-27 03:00:22,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:22,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:00:22,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489086798] [2019-12-27 03:00:22,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:00:22,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:22,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:00:22,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:22,156 INFO L87 Difference]: Start difference. First operand 45309 states and 172388 transitions. Second operand 5 states. [2019-12-27 03:00:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:22,273 INFO L93 Difference]: Finished difference Result 19765 states and 62245 transitions. [2019-12-27 03:00:22,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:00:22,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 03:00:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:22,301 INFO L225 Difference]: With dead ends: 19765 [2019-12-27 03:00:22,301 INFO L226 Difference]: Without dead ends: 18889 [2019-12-27 03:00:22,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:00:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18889 states. [2019-12-27 03:00:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18889 to 18889. [2019-12-27 03:00:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18889 states. [2019-12-27 03:00:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18889 states to 18889 states and 59447 transitions. [2019-12-27 03:00:22,589 INFO L78 Accepts]: Start accepts. Automaton has 18889 states and 59447 transitions. Word has length 30 [2019-12-27 03:00:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:22,590 INFO L462 AbstractCegarLoop]: Abstraction has 18889 states and 59447 transitions. [2019-12-27 03:00:22,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:00:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 18889 states and 59447 transitions. [2019-12-27 03:00:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 03:00:22,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:22,601 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] [2019-12-27 03:00:22,601 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:22,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:22,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1945851485, now seen corresponding path program 1 times [2019-12-27 03:00:22,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:22,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959032729] [2019-12-27 03:00:22,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:22,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:22,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959032729] [2019-12-27 03:00:22,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:22,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:00:22,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219422164] [2019-12-27 03:00:22,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:00:22,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:22,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:00:22,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:00:22,684 INFO L87 Difference]: Start difference. First operand 18889 states and 59447 transitions. Second operand 6 states. [2019-12-27 03:00:22,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:22,762 INFO L93 Difference]: Finished difference Result 3470 states and 8793 transitions. [2019-12-27 03:00:22,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:00:22,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 03:00:22,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:22,766 INFO L225 Difference]: With dead ends: 3470 [2019-12-27 03:00:22,766 INFO L226 Difference]: Without dead ends: 3101 [2019-12-27 03:00:22,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:00:22,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2019-12-27 03:00:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 3101. [2019-12-27 03:00:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3101 states. [2019-12-27 03:00:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 7755 transitions. [2019-12-27 03:00:22,798 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 7755 transitions. Word has length 31 [2019-12-27 03:00:22,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:22,799 INFO L462 AbstractCegarLoop]: Abstraction has 3101 states and 7755 transitions. [2019-12-27 03:00:22,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:00:22,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 7755 transitions. [2019-12-27 03:00:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 03:00:22,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:22,802 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] [2019-12-27 03:00:22,803 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:22,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:22,803 INFO L82 PathProgramCache]: Analyzing trace with hash -476238483, now seen corresponding path program 1 times [2019-12-27 03:00:22,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:22,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739949747] [2019-12-27 03:00:22,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:22,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739949747] [2019-12-27 03:00:22,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:22,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:00:22,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415932588] [2019-12-27 03:00:22,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:00:22,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:22,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:00:22,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:00:22,905 INFO L87 Difference]: Start difference. First operand 3101 states and 7755 transitions. Second operand 7 states. [2019-12-27 03:00:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:23,004 INFO L93 Difference]: Finished difference Result 1342 states and 3750 transitions. [2019-12-27 03:00:23,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:00:23,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-27 03:00:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:23,007 INFO L225 Difference]: With dead ends: 1342 [2019-12-27 03:00:23,007 INFO L226 Difference]: Without dead ends: 1293 [2019-12-27 03:00:23,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:00:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2019-12-27 03:00:23,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1181. [2019-12-27 03:00:23,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-12-27 03:00:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 3334 transitions. [2019-12-27 03:00:23,023 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 3334 transitions. Word has length 43 [2019-12-27 03:00:23,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:23,024 INFO L462 AbstractCegarLoop]: Abstraction has 1181 states and 3334 transitions. [2019-12-27 03:00:23,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:00:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 3334 transitions. [2019-12-27 03:00:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 03:00:23,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:23,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:23,027 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:23,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:23,027 INFO L82 PathProgramCache]: Analyzing trace with hash -409088440, now seen corresponding path program 1 times [2019-12-27 03:00:23,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:23,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125426469] [2019-12-27 03:00:23,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:23,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125426469] [2019-12-27 03:00:23,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:23,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:00:23,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048407470] [2019-12-27 03:00:23,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:00:23,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:23,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:00:23,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:23,178 INFO L87 Difference]: Start difference. First operand 1181 states and 3334 transitions. Second operand 5 states. [2019-12-27 03:00:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:23,502 INFO L93 Difference]: Finished difference Result 1666 states and 4696 transitions. [2019-12-27 03:00:23,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:00:23,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 03:00:23,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:23,505 INFO L225 Difference]: With dead ends: 1666 [2019-12-27 03:00:23,506 INFO L226 Difference]: Without dead ends: 1666 [2019-12-27 03:00:23,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-27 03:00:23,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2019-12-27 03:00:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1470. [2019-12-27 03:00:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1470 states. [2019-12-27 03:00:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 4144 transitions. [2019-12-27 03:00:23,530 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 4144 transitions. Word has length 58 [2019-12-27 03:00:23,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:23,530 INFO L462 AbstractCegarLoop]: Abstraction has 1470 states and 4144 transitions. [2019-12-27 03:00:23,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:00:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 4144 transitions. [2019-12-27 03:00:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 03:00:23,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:23,534 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] [2019-12-27 03:00:23,534 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:23,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:23,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2087231872, now seen corresponding path program 2 times [2019-12-27 03:00:23,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:23,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926205496] [2019-12-27 03:00:23,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:23,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926205496] [2019-12-27 03:00:23,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:23,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:00:23,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398047810] [2019-12-27 03:00:23,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:00:23,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:23,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:00:23,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:00:23,645 INFO L87 Difference]: Start difference. First operand 1470 states and 4144 transitions. Second operand 6 states. [2019-12-27 03:00:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:23,933 INFO L93 Difference]: Finished difference Result 1745 states and 4788 transitions. [2019-12-27 03:00:23,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:00:23,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 03:00:23,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:23,936 INFO L225 Difference]: With dead ends: 1745 [2019-12-27 03:00:23,936 INFO L226 Difference]: Without dead ends: 1745 [2019-12-27 03:00:23,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:00:23,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2019-12-27 03:00:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1522. [2019-12-27 03:00:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1522 states. [2019-12-27 03:00:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 4220 transitions. [2019-12-27 03:00:23,954 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 4220 transitions. Word has length 58 [2019-12-27 03:00:23,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:23,954 INFO L462 AbstractCegarLoop]: Abstraction has 1522 states and 4220 transitions. [2019-12-27 03:00:23,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:00:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 4220 transitions. [2019-12-27 03:00:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 03:00:23,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:23,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:00:23,956 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:23,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:23,957 INFO L82 PathProgramCache]: Analyzing trace with hash -893148506, now seen corresponding path program 3 times [2019-12-27 03:00:23,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:23,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497983060] [2019-12-27 03:00:23,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:24,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497983060] [2019-12-27 03:00:24,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:24,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:24,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198999221] [2019-12-27 03:00:24,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:24,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:24,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:24,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:24,029 INFO L87 Difference]: Start difference. First operand 1522 states and 4220 transitions. Second operand 3 states. [2019-12-27 03:00:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:24,045 INFO L93 Difference]: Finished difference Result 1414 states and 3884 transitions. [2019-12-27 03:00:24,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:24,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 03:00:24,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:24,048 INFO L225 Difference]: With dead ends: 1414 [2019-12-27 03:00:24,048 INFO L226 Difference]: Without dead ends: 1414 [2019-12-27 03:00:24,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:24,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2019-12-27 03:00:24,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2019-12-27 03:00:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-12-27 03:00:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 3884 transitions. [2019-12-27 03:00:24,072 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 3884 transitions. Word has length 58 [2019-12-27 03:00:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:24,073 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 3884 transitions. [2019-12-27 03:00:24,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 3884 transitions. [2019-12-27 03:00:24,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 03:00:24,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:24,075 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] [2019-12-27 03:00:24,076 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:24,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:24,076 INFO L82 PathProgramCache]: Analyzing trace with hash -465324325, now seen corresponding path program 1 times [2019-12-27 03:00:24,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:24,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286818555] [2019-12-27 03:00:24,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:24,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286818555] [2019-12-27 03:00:24,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:24,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:00:24,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105368243] [2019-12-27 03:00:24,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:00:24,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:24,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:00:24,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:24,154 INFO L87 Difference]: Start difference. First operand 1414 states and 3884 transitions. Second operand 3 states. [2019-12-27 03:00:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:24,213 INFO L93 Difference]: Finished difference Result 1413 states and 3882 transitions. [2019-12-27 03:00:24,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:00:24,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 03:00:24,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:24,217 INFO L225 Difference]: With dead ends: 1413 [2019-12-27 03:00:24,217 INFO L226 Difference]: Without dead ends: 1413 [2019-12-27 03:00:24,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:00:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-12-27 03:00:24,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1160. [2019-12-27 03:00:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-12-27 03:00:24,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 3188 transitions. [2019-12-27 03:00:24,243 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 3188 transitions. Word has length 59 [2019-12-27 03:00:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:24,244 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 3188 transitions. [2019-12-27 03:00:24,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:00:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 3188 transitions. [2019-12-27 03:00:24,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 03:00:24,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:24,247 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] [2019-12-27 03:00:24,248 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:24,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:24,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1056994783, now seen corresponding path program 1 times [2019-12-27 03:00:24,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:24,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841469445] [2019-12-27 03:00:24,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:24,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:24,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841469445] [2019-12-27 03:00:24,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:24,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:00:24,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268338912] [2019-12-27 03:00:24,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:00:24,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:24,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:00:24,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:00:24,442 INFO L87 Difference]: Start difference. First operand 1160 states and 3188 transitions. Second operand 10 states. [2019-12-27 03:00:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:24,719 INFO L93 Difference]: Finished difference Result 2229 states and 5665 transitions. [2019-12-27 03:00:24,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:00:24,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-12-27 03:00:24,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:24,722 INFO L225 Difference]: With dead ends: 2229 [2019-12-27 03:00:24,722 INFO L226 Difference]: Without dead ends: 1480 [2019-12-27 03:00:24,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 03:00:24,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-12-27 03:00:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1020. [2019-12-27 03:00:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-12-27 03:00:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2717 transitions. [2019-12-27 03:00:24,736 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2717 transitions. Word has length 60 [2019-12-27 03:00:24,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:24,736 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 2717 transitions. [2019-12-27 03:00:24,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:00:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2717 transitions. [2019-12-27 03:00:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 03:00:24,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:24,738 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] [2019-12-27 03:00:24,738 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:24,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:24,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1968443931, now seen corresponding path program 2 times [2019-12-27 03:00:24,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:24,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421600663] [2019-12-27 03:00:24,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:24,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421600663] [2019-12-27 03:00:24,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:24,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 03:00:24,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005491729] [2019-12-27 03:00:24,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 03:00:24,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:24,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 03:00:24,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:00:24,967 INFO L87 Difference]: Start difference. First operand 1020 states and 2717 transitions. Second operand 13 states. [2019-12-27 03:00:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:25,794 INFO L93 Difference]: Finished difference Result 2575 states and 6195 transitions. [2019-12-27 03:00:25,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 03:00:25,794 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-27 03:00:25,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:25,796 INFO L225 Difference]: With dead ends: 2575 [2019-12-27 03:00:25,796 INFO L226 Difference]: Without dead ends: 796 [2019-12-27 03:00:25,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2019-12-27 03:00:25,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-12-27 03:00:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 571. [2019-12-27 03:00:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-27 03:00:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1223 transitions. [2019-12-27 03:00:25,804 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1223 transitions. Word has length 60 [2019-12-27 03:00:25,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:25,804 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 1223 transitions. [2019-12-27 03:00:25,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 03:00:25,804 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1223 transitions. [2019-12-27 03:00:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 03:00:25,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:25,806 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] [2019-12-27 03:00:25,806 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:25,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:25,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1222711449, now seen corresponding path program 3 times [2019-12-27 03:00:25,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:25,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938834844] [2019-12-27 03:00:25,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:25,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938834844] [2019-12-27 03:00:25,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:25,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:00:25,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656737434] [2019-12-27 03:00:25,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:00:25,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:25,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:00:25,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:00:25,904 INFO L87 Difference]: Start difference. First operand 571 states and 1223 transitions. Second operand 5 states. [2019-12-27 03:00:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:25,948 INFO L93 Difference]: Finished difference Result 755 states and 1538 transitions. [2019-12-27 03:00:25,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:00:25,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-27 03:00:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:25,949 INFO L225 Difference]: With dead ends: 755 [2019-12-27 03:00:25,949 INFO L226 Difference]: Without dead ends: 215 [2019-12-27 03:00:25,950 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-27 03:00:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-12-27 03:00:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-12-27 03:00:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-12-27 03:00:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 364 transitions. [2019-12-27 03:00:25,953 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 364 transitions. Word has length 60 [2019-12-27 03:00:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:25,953 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 364 transitions. [2019-12-27 03:00:25,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:00:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 364 transitions. [2019-12-27 03:00:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 03:00:25,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:25,954 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] [2019-12-27 03:00:25,954 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:25,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:25,955 INFO L82 PathProgramCache]: Analyzing trace with hash 424334393, now seen corresponding path program 4 times [2019-12-27 03:00:25,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:25,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943169642] [2019-12-27 03:00:25,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:26,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943169642] [2019-12-27 03:00:26,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:26,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-27 03:00:26,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825228124] [2019-12-27 03:00:26,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 03:00:26,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:26,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 03:00:26,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:00:26,713 INFO L87 Difference]: Start difference. First operand 215 states and 364 transitions. Second operand 22 states. [2019-12-27 03:00:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:28,717 INFO L93 Difference]: Finished difference Result 407 states and 677 transitions. [2019-12-27 03:00:28,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 03:00:28,717 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2019-12-27 03:00:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:28,718 INFO L225 Difference]: With dead ends: 407 [2019-12-27 03:00:28,718 INFO L226 Difference]: Without dead ends: 374 [2019-12-27 03:00:28,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=388, Invalid=1964, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 03:00:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-12-27 03:00:28,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 280. [2019-12-27 03:00:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-27 03:00:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 470 transitions. [2019-12-27 03:00:28,724 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 470 transitions. Word has length 60 [2019-12-27 03:00:28,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:28,724 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 470 transitions. [2019-12-27 03:00:28,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 03:00:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 470 transitions. [2019-12-27 03:00:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 03:00:28,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:28,725 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] [2019-12-27 03:00:28,725 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:28,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:28,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1960747335, now seen corresponding path program 5 times [2019-12-27 03:00:28,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:28,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766592957] [2019-12-27 03:00:28,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:00:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:00:28,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766592957] [2019-12-27 03:00:28,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:00:28,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:00:28,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203812442] [2019-12-27 03:00:28,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 03:00:28,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:00:28,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 03:00:28,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:00:28,993 INFO L87 Difference]: Start difference. First operand 280 states and 470 transitions. Second operand 13 states. [2019-12-27 03:00:29,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:00:29,451 INFO L93 Difference]: Finished difference Result 423 states and 699 transitions. [2019-12-27 03:00:29,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:00:29,451 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-27 03:00:29,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:00:29,452 INFO L225 Difference]: With dead ends: 423 [2019-12-27 03:00:29,452 INFO L226 Difference]: Without dead ends: 390 [2019-12-27 03:00:29,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-27 03:00:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-12-27 03:00:29,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 323. [2019-12-27 03:00:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-27 03:00:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 549 transitions. [2019-12-27 03:00:29,460 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 549 transitions. Word has length 60 [2019-12-27 03:00:29,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:00:29,460 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 549 transitions. [2019-12-27 03:00:29,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 03:00:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 549 transitions. [2019-12-27 03:00:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 03:00:29,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:00:29,461 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] [2019-12-27 03:00:29,461 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:00:29,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:00:29,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1750352957, now seen corresponding path program 6 times [2019-12-27 03:00:29,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:00:29,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976117358] [2019-12-27 03:00:29,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:00:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:00:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:00:29,637 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:00:29,637 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:00:29,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~z$w_buff0~0_106 0) (= v_~z$r_buff0_thd2~0_89 0) (= v_~main$tmp_guard0~0_30 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd1~0_90) (< 0 |v_#StackHeapBarrier_21|) (= v_~a~0_108 0) (= v_~z$w_buff0_used~0_517 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1485~0.base_22| 1)) (= v_~z$r_buff0_thd0~0_321 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_244 0) (= 0 v_~z$w_buff1~0_99) (= 0 |v_#NULL.base_6|) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1485~0.base_22|) (= 0 v_~z$r_buff1_thd2~0_90) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~z$flush_delayed~0_47) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff0_thd3~0_147) (= 0 v_~z$r_buff1_thd4~0_142) (= 0 v_~z$r_buff1_thd3~0_154) (= 0 v_~weak$$choice0~0_24) (= v_~__unbuffered_cnt~0_141 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1485~0.base_22|)) (= v_~z$w_buff1_used~0_308 0) (= 0 v_~__unbuffered_p3_EAX~0_99) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1485~0.base_22| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1485~0.base_22|) |v_ULTIMATE.start_main_~#t1485~0.offset_17| 0)) |v_#memory_int_27|) (= v_~weak$$choice2~0_108 0) (= v_~z$r_buff0_thd1~0_89 0) (= 0 v_~z$r_buff0_thd4~0_241) (= 0 |v_ULTIMATE.start_main_~#t1485~0.offset_17|) (= v_~z~0_160 0) (= v_~z$mem_tmp~0_28 0) (= v_~y~0_41 0) (= v_~x~0_54 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1485~0.base_22| 4)) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_33|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_90, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_55|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_38|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_30|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_19|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|, ~a~0=v_~a~0_108, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_321, ULTIMATE.start_main_~#t1485~0.base=|v_ULTIMATE.start_main_~#t1485~0.base_22|, ULTIMATE.start_main_~#t1488~0.base=|v_ULTIMATE.start_main_~#t1488~0.base_20|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_241, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_99, #length=|v_#length_31|, ULTIMATE.start_main_~#t1486~0.offset=|v_ULTIMATE.start_main_~#t1486~0.offset_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_28, ULTIMATE.start_main_~#t1485~0.offset=|v_ULTIMATE.start_main_~#t1485~0.offset_17|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_96|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_308, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_30|, ~z$flush_delayed~0=v_~z$flush_delayed~0_47, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_33|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_32|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_141|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_90, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_147, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_54, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_142, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_40|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_99, ULTIMATE.start_main_~#t1487~0.offset=|v_ULTIMATE.start_main_~#t1487~0.offset_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_29|, ULTIMATE.start_main_~#t1487~0.base=|v_ULTIMATE.start_main_~#t1487~0.base_20|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_105|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_33|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_244, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_41|, ~y~0=v_~y~0_41, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_89, ULTIMATE.start_main_~#t1486~0.base=|v_ULTIMATE.start_main_~#t1486~0.base_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_517, ~z$w_buff0~0=v_~z$w_buff0~0_106, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_41|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_154, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_31|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_91|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_30|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_34|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_~#t1488~0.offset=|v_ULTIMATE.start_main_~#t1488~0.offset_16|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_89} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1485~0.base, ULTIMATE.start_main_~#t1488~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1486~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1485~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ULTIMATE.start_main_~#t1487~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_~#t1487~0.base, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1486~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1488~0.offset, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:00:29,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L823-1-->L825: Formula: (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1486~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1486~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1486~0.base_13|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1486~0.base_13| 1)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1486~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1486~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1486~0.base_13|) |v_ULTIMATE.start_main_~#t1486~0.offset_11| 1)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t1486~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1486~0.base=|v_ULTIMATE.start_main_~#t1486~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1486~0.offset=|v_ULTIMATE.start_main_~#t1486~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1486~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1486~0.offset] because there is no mapped edge [2019-12-27 03:00:29,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L825-1-->L827: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1487~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1487~0.base_10|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1487~0.base_10| 4)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1487~0.base_10| 1) |v_#valid_40|) (not (= |v_ULTIMATE.start_main_~#t1487~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t1487~0.offset_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1487~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1487~0.base_10|) |v_ULTIMATE.start_main_~#t1487~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1487~0.offset=|v_ULTIMATE.start_main_~#t1487~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1487~0.base=|v_ULTIMATE.start_main_~#t1487~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1487~0.offset, #length, ULTIMATE.start_main_~#t1487~0.base] because there is no mapped edge [2019-12-27 03:00:29,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-1-->L829: Formula: (and (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1488~0.base_11|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1488~0.base_11| 4)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1488~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1488~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1488~0.offset_10|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1488~0.base_11|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1488~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1488~0.base_11|) |v_ULTIMATE.start_main_~#t1488~0.offset_10| 3)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1488~0.base=|v_ULTIMATE.start_main_~#t1488~0.base_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1488~0.offset=|v_ULTIMATE.start_main_~#t1488~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1488~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1488~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 03:00:29,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L4-->L800: Formula: (and (= ~z$r_buff1_thd4~0_Out383084508 ~z$r_buff0_thd4~0_In383084508) (= ~z$r_buff0_thd1~0_In383084508 ~z$r_buff1_thd1~0_Out383084508) (= ~z$r_buff0_thd3~0_In383084508 ~z$r_buff1_thd3~0_Out383084508) (= 1 ~z$r_buff0_thd4~0_Out383084508) (= ~z$r_buff1_thd0~0_Out383084508 ~z$r_buff0_thd0~0_In383084508) (= ~z$r_buff0_thd2~0_In383084508 ~z$r_buff1_thd2~0_Out383084508) (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In383084508)) (= ~a~0_In383084508 ~__unbuffered_p3_EAX~0_Out383084508)) InVars {~a~0=~a~0_In383084508, P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In383084508, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In383084508, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In383084508, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In383084508, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In383084508, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In383084508} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In383084508, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out383084508, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out383084508, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out383084508, ~a~0=~a~0_In383084508, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In383084508, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out383084508, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out383084508, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out383084508, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out383084508, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In383084508, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In383084508, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In383084508} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 03:00:29,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_19|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_~x~0_32 1) (= v_~a~0_41 1) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_19|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_41, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, ~x~0=v_~x~0_32, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 03:00:29,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] P1ENTRY-->P1EXIT: Formula: (and (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_23) (= |v_P1Thread1of1ForFork1_#res.offset_11| 0) (= v_P1Thread1of1ForFork1_~arg.base_19 |v_P1Thread1of1ForFork1_#in~arg.base_19|) (= 0 |v_P1Thread1of1ForFork1_#res.base_11|) (= v_~x~0_41 2) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_19| v_P1Thread1of1ForFork1_~arg.offset_19)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_19, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, ~y~0=v_~y~0_32, ~x~0=v_~x~0_41, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 03:00:29,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-83935295 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-83935295 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-83935295| 0)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-83935295 |P3Thread1of1ForFork3_#t~ite11_Out-83935295|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-83935295, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-83935295} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-83935295, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-83935295, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-83935295|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 03:00:29,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L770-2-->L770-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In886888038 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In886888038 256) 0))) (or (and (= ~z~0_In886888038 |P2Thread1of1ForFork2_#t~ite3_Out886888038|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In886888038 |P2Thread1of1ForFork2_#t~ite3_Out886888038|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In886888038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In886888038, ~z$w_buff1~0=~z$w_buff1~0_In886888038, ~z~0=~z~0_In886888038} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out886888038|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In886888038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In886888038, ~z$w_buff1~0=~z$w_buff1~0_In886888038, ~z~0=~z~0_In886888038} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 03:00:29,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L770-4-->L771: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_14| v_~z~0_35) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_14|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_13|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_13|, ~z~0=v_~z~0_35} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 03:00:29,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L802-->L802-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd4~0_In-206261261 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-206261261 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-206261261 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-206261261 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-206261261 |P3Thread1of1ForFork3_#t~ite12_Out-206261261|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-206261261|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-206261261, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-206261261, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-206261261, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-206261261} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-206261261, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-206261261, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-206261261, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-206261261, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-206261261|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 03:00:29,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L803-->L804: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-740298771 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-740298771 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out-740298771 ~z$r_buff0_thd4~0_In-740298771) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-740298771)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-740298771, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-740298771} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-740298771, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-740298771, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-740298771|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 03:00:29,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-363160722 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-363160722 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-363160722 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-363160722 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-363160722|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out-363160722| ~z$r_buff1_thd4~0_In-363160722)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-363160722, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-363160722, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-363160722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-363160722} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-363160722, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-363160722, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-363160722|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-363160722, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-363160722} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 03:00:29,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L804-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_109 (+ v_~__unbuffered_cnt~0_110 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_84)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_84, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 03:00:29,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1459891929 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1459891929 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1459891929 |P2Thread1of1ForFork2_#t~ite5_Out-1459891929|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-1459891929|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1459891929, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1459891929} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1459891929|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1459891929, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1459891929} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 03:00:29,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L772-->L772-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In943081861 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In943081861 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In943081861 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In943081861 256)))) (or (and (= ~z$w_buff1_used~0_In943081861 |P2Thread1of1ForFork2_#t~ite6_Out943081861|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out943081861|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In943081861, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In943081861, ~z$w_buff1_used~0=~z$w_buff1_used~0_In943081861, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In943081861} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out943081861|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In943081861, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In943081861, ~z$w_buff1_used~0=~z$w_buff1_used~0_In943081861, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In943081861} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 03:00:29,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In203583452 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In203583452 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out203583452| ~z$r_buff0_thd3~0_In203583452)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out203583452| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In203583452, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In203583452} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In203583452, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In203583452, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out203583452|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 03:00:29,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2037912440 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-2037912440 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-2037912440 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-2037912440 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-2037912440|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-2037912440 |P2Thread1of1ForFork2_#t~ite8_Out-2037912440|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2037912440, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2037912440, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2037912440, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2037912440} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2037912440, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2037912440, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2037912440, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2037912440, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-2037912440|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 03:00:29,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_126) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_126, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 03:00:29,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L833-->L835-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_104 256)) (= (mod v_~z$r_buff0_thd0~0_62 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_62, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_62, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 03:00:29,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In113995089 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In113995089 256)))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out113995089| ~z$w_buff1~0_In113995089) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out113995089| ~z~0_In113995089)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In113995089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In113995089, ~z$w_buff1~0=~z$w_buff1~0_In113995089, ~z~0=~z~0_In113995089} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out113995089|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In113995089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In113995089, ~z$w_buff1~0=~z$w_buff1~0_In113995089, ~z~0=~z~0_In113995089} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 03:00:29,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-4-->L836: Formula: (= v_~z~0_32 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_32, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 03:00:29,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In50740794 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In50740794 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out50740794|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In50740794 |ULTIMATE.start_main_#t~ite21_Out50740794|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In50740794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In50740794} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In50740794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In50740794, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out50740794|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 03:00:29,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1850809648 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1850809648 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1850809648 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1850809648 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-1850809648| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1850809648 |ULTIMATE.start_main_#t~ite22_Out-1850809648|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1850809648, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1850809648, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1850809648, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1850809648} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1850809648, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1850809648, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1850809648, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1850809648, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1850809648|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 03:00:29,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-287655232 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-287655232 256)))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out-287655232| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-287655232 |ULTIMATE.start_main_#t~ite23_Out-287655232|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-287655232, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-287655232} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-287655232, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-287655232, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-287655232|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 03:00:29,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L839-->L839-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-45115231 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-45115231 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-45115231 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-45115231 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out-45115231| ~z$r_buff1_thd0~0_In-45115231) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite24_Out-45115231| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-45115231, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-45115231, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-45115231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-45115231} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-45115231, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-45115231, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-45115231, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-45115231|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-45115231} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 03:00:29,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L848-->L848-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1571881541 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1571881541 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1571881541 256)) (and (= 0 (mod ~z$r_buff1_thd0~0_In1571881541 256)) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In1571881541 256) 0)))) (= ~z$w_buff1~0_In1571881541 |ULTIMATE.start_main_#t~ite33_Out1571881541|) (= |ULTIMATE.start_main_#t~ite33_Out1571881541| |ULTIMATE.start_main_#t~ite34_Out1571881541|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite33_In1571881541| |ULTIMATE.start_main_#t~ite33_Out1571881541|) (= ~z$w_buff1~0_In1571881541 |ULTIMATE.start_main_#t~ite34_Out1571881541|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1571881541, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1571881541, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1571881541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1571881541, ~z$w_buff1~0=~z$w_buff1~0_In1571881541, ~weak$$choice2~0=~weak$$choice2~0_In1571881541, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In1571881541|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1571881541, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1571881541, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1571881541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1571881541, ~z$w_buff1~0=~z$w_buff1~0_In1571881541, ~weak$$choice2~0=~weak$$choice2~0_In1571881541, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1571881541|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1571881541|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 03:00:29,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L850-->L850-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1832957228 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1832957228| ~z$w_buff1_used~0_In-1832957228) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1832957228 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1832957228 256)) (and (= (mod ~z$w_buff1_used~0_In-1832957228 256) 0) .cse0) (and (= 0 (mod ~z$r_buff1_thd0~0_In-1832957228 256)) .cse0))) (= |ULTIMATE.start_main_#t~ite39_Out-1832957228| |ULTIMATE.start_main_#t~ite40_Out-1832957228|) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1832957228| ~z$w_buff1_used~0_In-1832957228) (= |ULTIMATE.start_main_#t~ite39_In-1832957228| |ULTIMATE.start_main_#t~ite39_Out-1832957228|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1832957228, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1832957228, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1832957228|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1832957228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1832957228, ~weak$$choice2~0=~weak$$choice2~0_In-1832957228} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1832957228, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1832957228|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1832957228|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1832957228, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1832957228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1832957228, ~weak$$choice2~0=~weak$$choice2~0_In-1832957228} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 03:00:29,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L851-->L852: Formula: (and (= v_~z$r_buff0_thd0~0_135 v_~z$r_buff0_thd0~0_134) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_41, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 03:00:29,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L852-->L852-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-139737811 256)))) (or (and .cse0 (= ~z$r_buff1_thd0~0_In-139737811 |ULTIMATE.start_main_#t~ite45_Out-139737811|) (= |ULTIMATE.start_main_#t~ite46_Out-139737811| |ULTIMATE.start_main_#t~ite45_Out-139737811|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-139737811 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-139737811 256))) (= (mod ~z$w_buff0_used~0_In-139737811 256) 0) (and (= (mod ~z$w_buff1_used~0_In-139737811 256) 0) .cse1)))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-139737811| ~z$r_buff1_thd0~0_In-139737811) (= |ULTIMATE.start_main_#t~ite45_In-139737811| |ULTIMATE.start_main_#t~ite45_Out-139737811|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-139737811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-139737811, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-139737811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-139737811, ~weak$$choice2~0=~weak$$choice2~0_In-139737811, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-139737811|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-139737811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-139737811, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-139737811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-139737811, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-139737811|, ~weak$$choice2~0=~weak$$choice2~0_In-139737811, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-139737811|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 03:00:29,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L854-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_38) (not (= (mod v_~z$flush_delayed~0_39 256) 0)) (= v_~z$mem_tmp~0_25 v_~z~0_127) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_12 256))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_39} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_25, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_38, ~z~0=v_~z~0_127, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:00:29,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 03:00:29,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:00:29 BasicIcfg [2019-12-27 03:00:29,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:00:29,789 INFO L168 Benchmark]: Toolchain (without parser) took 47256.32 ms. Allocated memory was 146.3 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 103.0 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 930.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:29,789 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 03:00:29,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.14 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.6 MB in the beginning and 158.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:29,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.19 ms. Allocated memory is still 204.5 MB. Free memory was 158.1 MB in the beginning and 154.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:29,791 INFO L168 Benchmark]: Boogie Preprocessor took 38.62 ms. Allocated memory is still 204.5 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:29,792 INFO L168 Benchmark]: RCFGBuilder took 814.65 ms. Allocated memory is still 204.5 MB. Free memory was 152.9 MB in the beginning and 104.0 MB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:29,792 INFO L168 Benchmark]: TraceAbstraction took 45531.35 ms. Allocated memory was 204.5 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 103.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 872.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:00:29,795 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.14 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.6 MB in the beginning and 158.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.19 ms. Allocated memory is still 204.5 MB. Free memory was 158.1 MB in the beginning and 154.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.62 ms. Allocated memory is still 204.5 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 814.65 ms. Allocated memory is still 204.5 MB. Free memory was 152.9 MB in the beginning and 104.0 MB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45531.35 ms. Allocated memory was 204.5 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 103.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 872.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 179 ProgramPointsBefore, 91 ProgramPointsAfterwards, 207 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 4846 VarBasedMoverChecksPositive, 179 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 208 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 50860 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t1485, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1486, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1487, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t1488, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 4 z$w_buff1 = z$w_buff0 [L785] 4 z$w_buff0 = 2 [L786] 4 z$w_buff1_used = z$w_buff0_used [L787] 4 z$w_buff0_used = (_Bool)1 [L800] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 1 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L770] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 z$flush_delayed = weak$$choice2 [L845] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L847] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L848] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L849] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 45.2s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2108 SDtfs, 2865 SDslu, 5836 SDs, 0 SdLazy, 3429 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 22 SyntacticMatches, 14 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57682occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 38662 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 815 NumberOfCodeBlocks, 815 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 737 ConstructedInterpolants, 0 QuantifiedInterpolants, 165107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...