/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/safe026_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:01:16,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:01:16,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:01:16,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:01:16,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:01:16,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:01:16,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:01:16,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:01:16,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:01:16,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:01:16,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:01:16,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:01:16,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:01:16,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:01:16,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:01:16,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:01:16,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:01:16,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:01:16,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:01:16,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:01:16,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:01:16,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:01:16,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:01:16,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:01:16,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:01:16,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:01:16,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:01:16,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:01:16,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:01:16,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:01:16,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:01:16,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:01:16,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:01:16,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:01:16,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:01:16,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:01:16,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:01:16,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:01:16,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:01:16,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:01:16,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:01:16,300 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 04:01:16,314 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:01:16,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:01:16,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:01:16,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:01:16,316 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:01:16,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:01:16,317 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:01:16,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:01:16,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:01:16,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:01:16,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:01:16,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:01:16,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:01:16,318 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:01:16,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:01:16,319 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:01:16,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:01:16,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:01:16,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:01:16,319 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:01:16,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:01:16,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:01:16,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:01:16,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:01:16,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:01:16,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:01:16,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:01:16,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:01:16,321 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:01:16,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:01:16,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:01:16,642 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:01:16,643 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:01:16,644 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:01:16,644 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_power.oepc.i [2019-12-27 04:01:16,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f2c51c1/a9f01706725840659fe14866ae52f1ab/FLAG5147d50a9 [2019-12-27 04:01:17,313 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:01:17,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.oepc.i [2019-12-27 04:01:17,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f2c51c1/a9f01706725840659fe14866ae52f1ab/FLAG5147d50a9 [2019-12-27 04:01:17,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44f2c51c1/a9f01706725840659fe14866ae52f1ab [2019-12-27 04:01:17,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:01:17,646 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:01:17,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:01:17,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:01:17,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:01:17,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:01:17" (1/1) ... [2019-12-27 04:01:17,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e54f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:17, skipping insertion in model container [2019-12-27 04:01:17,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:01:17" (1/1) ... [2019-12-27 04:01:17,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:01:17,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:01:18,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:01:18,291 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:01:18,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:01:18,423 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:01:18,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:18 WrapperNode [2019-12-27 04:01:18,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:01:18,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:01:18,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:01:18,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:01:18,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:18" (1/1) ... [2019-12-27 04:01:18,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:18" (1/1) ... [2019-12-27 04:01:18,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:01:18,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:01:18,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:01:18,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:01:18,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:18" (1/1) ... [2019-12-27 04:01:18,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:18" (1/1) ... [2019-12-27 04:01:18,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:18" (1/1) ... [2019-12-27 04:01:18,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:18" (1/1) ... [2019-12-27 04:01:18,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:18" (1/1) ... [2019-12-27 04:01:18,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:18" (1/1) ... [2019-12-27 04:01:18,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:18" (1/1) ... [2019-12-27 04:01:18,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:01:18,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:01:18,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:01:18,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:01:18,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:18" (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 04:01:18,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:01:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 04:01:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:01:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:01:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 04:01:18,593 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 04:01:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 04:01:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 04:01:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 04:01:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 04:01:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 04:01:18,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:01:18,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:01:18,597 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 04:01:19,360 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:01:19,361 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 04:01:19,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:01:19 BoogieIcfgContainer [2019-12-27 04:01:19,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:01:19,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:01:19,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:01:19,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:01:19,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:01:17" (1/3) ... [2019-12-27 04:01:19,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f460b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:01:19, skipping insertion in model container [2019-12-27 04:01:19,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:01:18" (2/3) ... [2019-12-27 04:01:19,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f460b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:01:19, skipping insertion in model container [2019-12-27 04:01:19,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:01:19" (3/3) ... [2019-12-27 04:01:19,377 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_power.oepc.i [2019-12-27 04:01:19,387 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:01:19,388 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:01:19,399 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 04:01:19,400 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:01:19,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,451 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,451 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,451 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,452 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,452 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,481 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,482 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,497 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,498 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,540 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,541 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,541 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,546 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,546 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,550 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,559 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:01:19,579 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 04:01:19,601 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:01:19,601 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:01:19,601 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:01:19,601 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:01:19,601 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:01:19,601 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:01:19,602 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:01:19,602 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:01:19,618 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 04:01:19,620 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 04:01:19,727 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 04:01:19,727 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:01:19,751 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 04:01:19,795 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 04:01:19,860 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 04:01:19,861 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:01:19,878 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 04:01:19,922 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 04:01:19,923 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:01:20,506 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-12-27 04:01:24,792 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 04:01:25,213 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 04:01:25,326 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 04:01:25,346 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78269 [2019-12-27 04:01:25,346 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 04:01:25,350 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-27 04:01:41,717 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-27 04:01:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-27 04:01:41,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:01:41,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:01:41,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:01:41,724 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:01:41,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:01:41,729 INFO L82 PathProgramCache]: Analyzing trace with hash 909914, now seen corresponding path program 1 times [2019-12-27 04:01:41,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:01:41,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83088194] [2019-12-27 04:01:41,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:01:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:01:41,932 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 04:01:41,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83088194] [2019-12-27 04:01:41,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:01:41,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:01:41,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033831050] [2019-12-27 04:01:41,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:01:41,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:01:41,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:01:41,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:01:41,958 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-27 04:01:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:01:43,471 INFO L93 Difference]: Finished difference Result 108680 states and 463562 transitions. [2019-12-27 04:01:43,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:01:43,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:01:43,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:01:44,327 INFO L225 Difference]: With dead ends: 108680 [2019-12-27 04:01:44,327 INFO L226 Difference]: Without dead ends: 102440 [2019-12-27 04:01:44,329 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 04:01:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102440 states. [2019-12-27 04:01:56,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102440 to 102440. [2019-12-27 04:01:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102440 states. [2019-12-27 04:01:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102440 states to 102440 states and 436366 transitions. [2019-12-27 04:01:56,650 INFO L78 Accepts]: Start accepts. Automaton has 102440 states and 436366 transitions. Word has length 3 [2019-12-27 04:01:56,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:01:56,650 INFO L462 AbstractCegarLoop]: Abstraction has 102440 states and 436366 transitions. [2019-12-27 04:01:56,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:01:56,651 INFO L276 IsEmpty]: Start isEmpty. Operand 102440 states and 436366 transitions. [2019-12-27 04:01:56,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:01:56,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:01:56,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:01:56,655 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:01:56,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:01:56,656 INFO L82 PathProgramCache]: Analyzing trace with hash -975068220, now seen corresponding path program 1 times [2019-12-27 04:01:56,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:01:56,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544997010] [2019-12-27 04:01:56,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:01:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:01:56,786 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 04:01:56,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544997010] [2019-12-27 04:01:56,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:01:56,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:01:56,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792582442] [2019-12-27 04:01:56,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:01:56,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:01:56,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:01:56,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:01:56,792 INFO L87 Difference]: Start difference. First operand 102440 states and 436366 transitions. Second operand 4 states. [2019-12-27 04:02:01,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:01,939 INFO L93 Difference]: Finished difference Result 163248 states and 665679 transitions. [2019-12-27 04:02:01,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:02:01,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 04:02:01,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:02,591 INFO L225 Difference]: With dead ends: 163248 [2019-12-27 04:02:02,591 INFO L226 Difference]: Without dead ends: 163199 [2019-12-27 04:02:02,592 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 04:02:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163199 states. [2019-12-27 04:02:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163199 to 148639. [2019-12-27 04:02:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148639 states. [2019-12-27 04:02:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148639 states to 148639 states and 614105 transitions. [2019-12-27 04:02:17,290 INFO L78 Accepts]: Start accepts. Automaton has 148639 states and 614105 transitions. Word has length 11 [2019-12-27 04:02:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:17,291 INFO L462 AbstractCegarLoop]: Abstraction has 148639 states and 614105 transitions. [2019-12-27 04:02:17,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:02:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 148639 states and 614105 transitions. [2019-12-27 04:02:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:02:17,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:17,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:17,298 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:17,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:17,298 INFO L82 PathProgramCache]: Analyzing trace with hash -112330344, now seen corresponding path program 1 times [2019-12-27 04:02:17,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:17,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972968974] [2019-12-27 04:02:17,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:17,427 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 04:02:17,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972968974] [2019-12-27 04:02:17,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:17,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:02:17,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995644455] [2019-12-27 04:02:17,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:02:17,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:17,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:02:17,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:02:17,430 INFO L87 Difference]: Start difference. First operand 148639 states and 614105 transitions. Second operand 4 states. [2019-12-27 04:02:18,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:18,677 INFO L93 Difference]: Finished difference Result 208779 states and 842772 transitions. [2019-12-27 04:02:18,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:02:18,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 04:02:18,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:25,706 INFO L225 Difference]: With dead ends: 208779 [2019-12-27 04:02:25,707 INFO L226 Difference]: Without dead ends: 208723 [2019-12-27 04:02:25,707 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 04:02:30,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208723 states. [2019-12-27 04:02:33,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208723 to 175996. [2019-12-27 04:02:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175996 states. [2019-12-27 04:02:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175996 states to 175996 states and 723083 transitions. [2019-12-27 04:02:34,985 INFO L78 Accepts]: Start accepts. Automaton has 175996 states and 723083 transitions. Word has length 13 [2019-12-27 04:02:34,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:34,986 INFO L462 AbstractCegarLoop]: Abstraction has 175996 states and 723083 transitions. [2019-12-27 04:02:34,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:02:34,987 INFO L276 IsEmpty]: Start isEmpty. Operand 175996 states and 723083 transitions. [2019-12-27 04:02:34,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 04:02:34,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:34,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:34,996 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:34,997 INFO L82 PathProgramCache]: Analyzing trace with hash -790185689, now seen corresponding path program 1 times [2019-12-27 04:02:34,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:34,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707765592] [2019-12-27 04:02:34,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:02:35,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707765592] [2019-12-27 04:02:35,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:35,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:02:35,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869045601] [2019-12-27 04:02:35,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:02:35,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:35,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:02:35,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:02:35,133 INFO L87 Difference]: Start difference. First operand 175996 states and 723083 transitions. Second operand 5 states. [2019-12-27 04:02:43,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:02:43,455 INFO L93 Difference]: Finished difference Result 234922 states and 955485 transitions. [2019-12-27 04:02:43,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:02:43,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 04:02:43,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:02:44,140 INFO L225 Difference]: With dead ends: 234922 [2019-12-27 04:02:44,141 INFO L226 Difference]: Without dead ends: 234922 [2019-12-27 04:02:44,141 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 04:02:49,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234922 states. [2019-12-27 04:02:53,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234922 to 195490. [2019-12-27 04:02:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195490 states. [2019-12-27 04:02:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195490 states to 195490 states and 801473 transitions. [2019-12-27 04:02:54,078 INFO L78 Accepts]: Start accepts. Automaton has 195490 states and 801473 transitions. Word has length 16 [2019-12-27 04:02:54,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:02:54,079 INFO L462 AbstractCegarLoop]: Abstraction has 195490 states and 801473 transitions. [2019-12-27 04:02:54,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:02:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 195490 states and 801473 transitions. [2019-12-27 04:02:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:02:54,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:02:54,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:02:54,094 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:02:54,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:02:54,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1153162558, now seen corresponding path program 1 times [2019-12-27 04:02:54,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:02:54,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127280602] [2019-12-27 04:02:54,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:02:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:02:54,167 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 04:02:54,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127280602] [2019-12-27 04:02:54,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:02:54,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:02:54,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155609587] [2019-12-27 04:02:54,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:02:54,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:02:54,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:02:54,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:02:54,169 INFO L87 Difference]: Start difference. First operand 195490 states and 801473 transitions. Second operand 3 states. [2019-12-27 04:03:00,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:03:00,238 INFO L93 Difference]: Finished difference Result 195126 states and 800046 transitions. [2019-12-27 04:03:00,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:03:00,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 04:03:00,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:03:01,613 INFO L225 Difference]: With dead ends: 195126 [2019-12-27 04:03:01,613 INFO L226 Difference]: Without dead ends: 195126 [2019-12-27 04:03:01,614 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 04:03:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195126 states. [2019-12-27 04:03:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195126 to 195126. [2019-12-27 04:03:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195126 states. [2019-12-27 04:03:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195126 states to 195126 states and 800046 transitions. [2019-12-27 04:03:15,534 INFO L78 Accepts]: Start accepts. Automaton has 195126 states and 800046 transitions. Word has length 18 [2019-12-27 04:03:15,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:03:15,534 INFO L462 AbstractCegarLoop]: Abstraction has 195126 states and 800046 transitions. [2019-12-27 04:03:15,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:03:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 195126 states and 800046 transitions. [2019-12-27 04:03:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:03:15,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:03:15,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:03:15,554 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:03:15,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:03:15,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1951188865, now seen corresponding path program 1 times [2019-12-27 04:03:15,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:03:15,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86670591] [2019-12-27 04:03:15,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:03:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:03:15,641 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 04:03:15,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86670591] [2019-12-27 04:03:15,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:03:15,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:03:15,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048044025] [2019-12-27 04:03:15,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:03:15,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:03:15,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:03:15,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:03:15,645 INFO L87 Difference]: Start difference. First operand 195126 states and 800046 transitions. Second operand 4 states. [2019-12-27 04:03:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:03:24,124 INFO L93 Difference]: Finished difference Result 367409 states and 1507754 transitions. [2019-12-27 04:03:24,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:03:24,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 04:03:24,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:03:25,545 INFO L225 Difference]: With dead ends: 367409 [2019-12-27 04:03:25,545 INFO L226 Difference]: Without dead ends: 208324 [2019-12-27 04:03:25,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 04:03:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208324 states. [2019-12-27 04:03:38,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208324 to 206903. [2019-12-27 04:03:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206903 states. [2019-12-27 04:03:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206903 states to 206903 states and 837795 transitions. [2019-12-27 04:03:40,078 INFO L78 Accepts]: Start accepts. Automaton has 206903 states and 837795 transitions. Word has length 19 [2019-12-27 04:03:40,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:03:40,078 INFO L462 AbstractCegarLoop]: Abstraction has 206903 states and 837795 transitions. [2019-12-27 04:03:40,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:03:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 206903 states and 837795 transitions. [2019-12-27 04:03:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:03:40,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:03:40,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:03:40,097 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:03:40,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:03:40,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2060703810, now seen corresponding path program 1 times [2019-12-27 04:03:40,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:03:40,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992187115] [2019-12-27 04:03:40,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:03:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:03:40,176 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 04:03:40,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992187115] [2019-12-27 04:03:40,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:03:40,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:03:40,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379534018] [2019-12-27 04:03:40,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:03:40,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:03:40,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:03:40,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:03:40,178 INFO L87 Difference]: Start difference. First operand 206903 states and 837795 transitions. Second operand 4 states. [2019-12-27 04:03:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:03:40,399 INFO L93 Difference]: Finished difference Result 53084 states and 178612 transitions. [2019-12-27 04:03:40,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:03:40,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 04:03:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:03:40,473 INFO L225 Difference]: With dead ends: 53084 [2019-12-27 04:03:40,473 INFO L226 Difference]: Without dead ends: 41205 [2019-12-27 04:03:40,473 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 04:03:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41205 states. [2019-12-27 04:03:46,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41205 to 40210. [2019-12-27 04:03:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40210 states. [2019-12-27 04:03:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40210 states to 40210 states and 128989 transitions. [2019-12-27 04:03:46,756 INFO L78 Accepts]: Start accepts. Automaton has 40210 states and 128989 transitions. Word has length 19 [2019-12-27 04:03:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:03:46,757 INFO L462 AbstractCegarLoop]: Abstraction has 40210 states and 128989 transitions. [2019-12-27 04:03:46,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:03:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 40210 states and 128989 transitions. [2019-12-27 04:03:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 04:03:46,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:03:46,763 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] [2019-12-27 04:03:46,763 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:03:46,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:03:46,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2079194331, now seen corresponding path program 1 times [2019-12-27 04:03:46,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:03:46,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396426521] [2019-12-27 04:03:46,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:03:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:03:46,858 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 04:03:46,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396426521] [2019-12-27 04:03:46,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:03:46,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:03:46,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970110099] [2019-12-27 04:03:46,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:03:46,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:03:46,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:03:46,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:03:46,861 INFO L87 Difference]: Start difference. First operand 40210 states and 128989 transitions. Second operand 6 states. [2019-12-27 04:03:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:03:47,768 INFO L93 Difference]: Finished difference Result 60602 states and 188612 transitions. [2019-12-27 04:03:47,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:03:47,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 04:03:47,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:03:47,878 INFO L225 Difference]: With dead ends: 60602 [2019-12-27 04:03:47,878 INFO L226 Difference]: Without dead ends: 60504 [2019-12-27 04:03:47,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:03:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60504 states. [2019-12-27 04:03:48,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60504 to 40348. [2019-12-27 04:03:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40348 states. [2019-12-27 04:03:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40348 states to 40348 states and 128423 transitions. [2019-12-27 04:03:49,007 INFO L78 Accepts]: Start accepts. Automaton has 40348 states and 128423 transitions. Word has length 22 [2019-12-27 04:03:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:03:49,007 INFO L462 AbstractCegarLoop]: Abstraction has 40348 states and 128423 transitions. [2019-12-27 04:03:49,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:03:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 40348 states and 128423 transitions. [2019-12-27 04:03:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:03:49,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:03:49,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:03:49,018 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:03:49,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:03:49,018 INFO L82 PathProgramCache]: Analyzing trace with hash -356343789, now seen corresponding path program 1 times [2019-12-27 04:03:49,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:03:49,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297915375] [2019-12-27 04:03:49,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:03:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:03:49,115 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 04:03:49,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297915375] [2019-12-27 04:03:49,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:03:49,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:03:49,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242399913] [2019-12-27 04:03:49,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:03:49,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:03:49,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:03:49,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:03:49,117 INFO L87 Difference]: Start difference. First operand 40348 states and 128423 transitions. Second operand 5 states. [2019-12-27 04:03:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:03:49,679 INFO L93 Difference]: Finished difference Result 56186 states and 174944 transitions. [2019-12-27 04:03:49,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:03:49,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 04:03:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:03:49,765 INFO L225 Difference]: With dead ends: 56186 [2019-12-27 04:03:49,765 INFO L226 Difference]: Without dead ends: 55974 [2019-12-27 04:03:49,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 3 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 04:03:49,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55974 states. [2019-12-27 04:03:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55974 to 47425. [2019-12-27 04:03:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47425 states. [2019-12-27 04:03:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47425 states to 47425 states and 150377 transitions. [2019-12-27 04:03:51,141 INFO L78 Accepts]: Start accepts. Automaton has 47425 states and 150377 transitions. Word has length 25 [2019-12-27 04:03:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:03:51,141 INFO L462 AbstractCegarLoop]: Abstraction has 47425 states and 150377 transitions. [2019-12-27 04:03:51,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:03:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand 47425 states and 150377 transitions. [2019-12-27 04:03:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:03:51,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:03:51,155 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] [2019-12-27 04:03:51,155 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:03:51,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:03:51,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1041381309, now seen corresponding path program 1 times [2019-12-27 04:03:51,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:03:51,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059060235] [2019-12-27 04:03:51,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:03:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:03:51,231 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 04:03:51,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059060235] [2019-12-27 04:03:51,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:03:51,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:03:51,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311705838] [2019-12-27 04:03:51,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:03:51,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:03:51,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:03:51,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:03:51,233 INFO L87 Difference]: Start difference. First operand 47425 states and 150377 transitions. Second operand 6 states. [2019-12-27 04:03:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:03:52,010 INFO L93 Difference]: Finished difference Result 66982 states and 207084 transitions. [2019-12-27 04:03:52,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 04:03:52,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 04:03:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:03:52,167 INFO L225 Difference]: With dead ends: 66982 [2019-12-27 04:03:52,167 INFO L226 Difference]: Without dead ends: 66389 [2019-12-27 04:03:52,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:03:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66389 states. [2019-12-27 04:03:53,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66389 to 52066. [2019-12-27 04:03:53,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52066 states. [2019-12-27 04:03:53,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52066 states to 52066 states and 164051 transitions. [2019-12-27 04:03:53,756 INFO L78 Accepts]: Start accepts. Automaton has 52066 states and 164051 transitions. Word has length 27 [2019-12-27 04:03:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:03:53,756 INFO L462 AbstractCegarLoop]: Abstraction has 52066 states and 164051 transitions. [2019-12-27 04:03:53,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:03:53,756 INFO L276 IsEmpty]: Start isEmpty. Operand 52066 states and 164051 transitions. [2019-12-27 04:03:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 04:03:53,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:03:53,773 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 04:03:53,773 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:03:53,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:03:53,773 INFO L82 PathProgramCache]: Analyzing trace with hash -524022794, now seen corresponding path program 1 times [2019-12-27 04:03:53,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:03:53,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558838884] [2019-12-27 04:03:53,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:03:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:03:53,822 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 04:03:53,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558838884] [2019-12-27 04:03:53,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:03:53,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:03:53,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844244220] [2019-12-27 04:03:53,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:03:53,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:03:53,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:03:53,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:03:53,824 INFO L87 Difference]: Start difference. First operand 52066 states and 164051 transitions. Second operand 4 states. [2019-12-27 04:03:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:03:54,177 INFO L93 Difference]: Finished difference Result 118270 states and 380880 transitions. [2019-12-27 04:03:54,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:03:54,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-27 04:03:54,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:03:54,223 INFO L225 Difference]: With dead ends: 118270 [2019-12-27 04:03:54,223 INFO L226 Difference]: Without dead ends: 28049 [2019-12-27 04:03:54,224 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 04:03:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28049 states. [2019-12-27 04:03:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28049 to 27357. [2019-12-27 04:03:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27357 states. [2019-12-27 04:03:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27357 states to 27357 states and 84690 transitions. [2019-12-27 04:03:54,684 INFO L78 Accepts]: Start accepts. Automaton has 27357 states and 84690 transitions. Word has length 29 [2019-12-27 04:03:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:03:54,684 INFO L462 AbstractCegarLoop]: Abstraction has 27357 states and 84690 transitions. [2019-12-27 04:03:54,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:03:54,684 INFO L276 IsEmpty]: Start isEmpty. Operand 27357 states and 84690 transitions. [2019-12-27 04:03:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 04:03:54,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:03:54,697 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 04:03:54,698 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:03:54,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:03:54,698 INFO L82 PathProgramCache]: Analyzing trace with hash -116284186, now seen corresponding path program 1 times [2019-12-27 04:03:54,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:03:54,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291704398] [2019-12-27 04:03:54,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:03:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:03:54,771 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 04:03:54,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291704398] [2019-12-27 04:03:54,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:03:54,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:03:54,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28927004] [2019-12-27 04:03:54,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:03:54,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:03:54,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:03:54,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:03:54,774 INFO L87 Difference]: Start difference. First operand 27357 states and 84690 transitions. Second operand 5 states. [2019-12-27 04:03:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:03:55,488 INFO L93 Difference]: Finished difference Result 41160 states and 127027 transitions. [2019-12-27 04:03:55,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:03:55,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 04:03:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:03:55,552 INFO L225 Difference]: With dead ends: 41160 [2019-12-27 04:03:55,552 INFO L226 Difference]: Without dead ends: 41160 [2019-12-27 04:03:55,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:03:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41160 states. [2019-12-27 04:03:56,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41160 to 36991. [2019-12-27 04:03:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36991 states. [2019-12-27 04:03:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36991 states to 36991 states and 114873 transitions. [2019-12-27 04:03:56,483 INFO L78 Accepts]: Start accepts. Automaton has 36991 states and 114873 transitions. Word has length 30 [2019-12-27 04:03:56,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:03:56,483 INFO L462 AbstractCegarLoop]: Abstraction has 36991 states and 114873 transitions. [2019-12-27 04:03:56,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:03:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 36991 states and 114873 transitions. [2019-12-27 04:03:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 04:03:56,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:03:56,501 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 04:03:56,501 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:03:56,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:03:56,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1132903455, now seen corresponding path program 1 times [2019-12-27 04:03:56,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:03:56,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31019088] [2019-12-27 04:03:56,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:03:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:03:56,574 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 04:03:56,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31019088] [2019-12-27 04:03:56,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:03:56,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:03:56,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676552810] [2019-12-27 04:03:56,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:03:56,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:03:56,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:03:56,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:03:56,576 INFO L87 Difference]: Start difference. First operand 36991 states and 114873 transitions. Second operand 5 states. [2019-12-27 04:03:57,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:03:57,376 INFO L93 Difference]: Finished difference Result 53889 states and 165459 transitions. [2019-12-27 04:03:57,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:03:57,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 04:03:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:03:57,462 INFO L225 Difference]: With dead ends: 53889 [2019-12-27 04:03:57,462 INFO L226 Difference]: Without dead ends: 53840 [2019-12-27 04:03:57,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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 04:03:57,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53840 states. [2019-12-27 04:03:58,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53840 to 44806. [2019-12-27 04:03:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44806 states. [2019-12-27 04:03:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44806 states to 44806 states and 139518 transitions. [2019-12-27 04:03:58,681 INFO L78 Accepts]: Start accepts. Automaton has 44806 states and 139518 transitions. Word has length 30 [2019-12-27 04:03:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:03:58,681 INFO L462 AbstractCegarLoop]: Abstraction has 44806 states and 139518 transitions. [2019-12-27 04:03:58,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:03:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 44806 states and 139518 transitions. [2019-12-27 04:03:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 04:03:58,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:03:58,700 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 04:03:58,700 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:03:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:03:58,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1026319235, now seen corresponding path program 1 times [2019-12-27 04:03:58,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:03:58,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597784055] [2019-12-27 04:03:58,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:03:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:03:58,774 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 04:03:58,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597784055] [2019-12-27 04:03:58,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:03:58,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:03:58,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546382996] [2019-12-27 04:03:58,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:03:58,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:03:58,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:03:58,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:03:58,776 INFO L87 Difference]: Start difference. First operand 44806 states and 139518 transitions. Second operand 5 states. [2019-12-27 04:03:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:03:58,909 INFO L93 Difference]: Finished difference Result 21943 states and 64706 transitions. [2019-12-27 04:03:58,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:03:58,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 04:03:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:03:58,946 INFO L225 Difference]: With dead ends: 21943 [2019-12-27 04:03:58,946 INFO L226 Difference]: Without dead ends: 19299 [2019-12-27 04:03:58,947 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 04:03:59,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19299 states. [2019-12-27 04:03:59,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19299 to 18143. [2019-12-27 04:03:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18143 states. [2019-12-27 04:03:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18143 states to 18143 states and 53716 transitions. [2019-12-27 04:03:59,217 INFO L78 Accepts]: Start accepts. Automaton has 18143 states and 53716 transitions. Word has length 31 [2019-12-27 04:03:59,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:03:59,217 INFO L462 AbstractCegarLoop]: Abstraction has 18143 states and 53716 transitions. [2019-12-27 04:03:59,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:03:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 18143 states and 53716 transitions. [2019-12-27 04:03:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 04:03:59,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:03:59,233 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] [2019-12-27 04:03:59,233 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:03:59,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:03:59,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1993081713, now seen corresponding path program 1 times [2019-12-27 04:03:59,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:03:59,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788666331] [2019-12-27 04:03:59,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:03:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:03:59,313 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 04:03:59,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788666331] [2019-12-27 04:03:59,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:03:59,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:03:59,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947402172] [2019-12-27 04:03:59,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:03:59,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:03:59,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:03:59,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:03:59,315 INFO L87 Difference]: Start difference. First operand 18143 states and 53716 transitions. Second operand 7 states. [2019-12-27 04:04:00,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:00,088 INFO L93 Difference]: Finished difference Result 19608 states and 56880 transitions. [2019-12-27 04:04:00,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 04:04:00,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 04:04:00,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:00,122 INFO L225 Difference]: With dead ends: 19608 [2019-12-27 04:04:00,123 INFO L226 Difference]: Without dead ends: 18921 [2019-12-27 04:04:00,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:04:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18921 states. [2019-12-27 04:04:00,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18921 to 17152. [2019-12-27 04:04:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17152 states. [2019-12-27 04:04:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17152 states to 17152 states and 50369 transitions. [2019-12-27 04:04:00,376 INFO L78 Accepts]: Start accepts. Automaton has 17152 states and 50369 transitions. Word has length 33 [2019-12-27 04:04:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:00,376 INFO L462 AbstractCegarLoop]: Abstraction has 17152 states and 50369 transitions. [2019-12-27 04:04:00,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:04:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 17152 states and 50369 transitions. [2019-12-27 04:04:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 04:04:00,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:00,399 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] [2019-12-27 04:04:00,399 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:00,400 INFO L82 PathProgramCache]: Analyzing trace with hash -739159160, now seen corresponding path program 1 times [2019-12-27 04:04:00,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:00,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245671425] [2019-12-27 04:04:00,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:00,503 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 04:04:00,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245671425] [2019-12-27 04:04:00,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:00,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:04:00,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170876585] [2019-12-27 04:04:00,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:04:00,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:00,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:04:00,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:04:00,509 INFO L87 Difference]: Start difference. First operand 17152 states and 50369 transitions. Second operand 6 states. [2019-12-27 04:04:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:01,627 INFO L93 Difference]: Finished difference Result 22796 states and 65727 transitions. [2019-12-27 04:04:01,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 04:04:01,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 04:04:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:01,657 INFO L225 Difference]: With dead ends: 22796 [2019-12-27 04:04:01,657 INFO L226 Difference]: Without dead ends: 22796 [2019-12-27 04:04:01,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:04:01,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22796 states. [2019-12-27 04:04:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22796 to 17194. [2019-12-27 04:04:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17194 states. [2019-12-27 04:04:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17194 states to 17194 states and 50488 transitions. [2019-12-27 04:04:01,918 INFO L78 Accepts]: Start accepts. Automaton has 17194 states and 50488 transitions. Word has length 40 [2019-12-27 04:04:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:01,918 INFO L462 AbstractCegarLoop]: Abstraction has 17194 states and 50488 transitions. [2019-12-27 04:04:01,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:04:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 17194 states and 50488 transitions. [2019-12-27 04:04:01,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 04:04:01,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:01,939 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] [2019-12-27 04:04:01,939 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:01,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:01,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1031083350, now seen corresponding path program 2 times [2019-12-27 04:04:01,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:01,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570340368] [2019-12-27 04:04:01,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:04:01,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570340368] [2019-12-27 04:04:01,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:01,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:04:01,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279457075] [2019-12-27 04:04:01,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:04:01,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:01,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:04:01,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:04:01,993 INFO L87 Difference]: Start difference. First operand 17194 states and 50488 transitions. Second operand 3 states. [2019-12-27 04:04:02,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:02,052 INFO L93 Difference]: Finished difference Result 13828 states and 39650 transitions. [2019-12-27 04:04:02,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:04:02,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 04:04:02,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:02,075 INFO L225 Difference]: With dead ends: 13828 [2019-12-27 04:04:02,076 INFO L226 Difference]: Without dead ends: 13828 [2019-12-27 04:04:02,076 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 04:04:02,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13828 states. [2019-12-27 04:04:02,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13828 to 13824. [2019-12-27 04:04:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13824 states. [2019-12-27 04:04:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13824 states to 13824 states and 39642 transitions. [2019-12-27 04:04:02,274 INFO L78 Accepts]: Start accepts. Automaton has 13824 states and 39642 transitions. Word has length 40 [2019-12-27 04:04:02,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:02,274 INFO L462 AbstractCegarLoop]: Abstraction has 13824 states and 39642 transitions. [2019-12-27 04:04:02,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:04:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 13824 states and 39642 transitions. [2019-12-27 04:04:02,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 04:04:02,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:02,288 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] [2019-12-27 04:04:02,288 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:02,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:02,289 INFO L82 PathProgramCache]: Analyzing trace with hash 234062339, now seen corresponding path program 1 times [2019-12-27 04:04:02,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:02,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268130036] [2019-12-27 04:04:02,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:02,335 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 04:04:02,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268130036] [2019-12-27 04:04:02,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:02,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:04:02,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213683899] [2019-12-27 04:04:02,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:04:02,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:02,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:04:02,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:04:02,337 INFO L87 Difference]: Start difference. First operand 13824 states and 39642 transitions. Second operand 3 states. [2019-12-27 04:04:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:02,396 INFO L93 Difference]: Finished difference Result 13762 states and 39441 transitions. [2019-12-27 04:04:02,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:04:02,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 04:04:02,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:02,419 INFO L225 Difference]: With dead ends: 13762 [2019-12-27 04:04:02,420 INFO L226 Difference]: Without dead ends: 13762 [2019-12-27 04:04:02,420 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 04:04:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13762 states. [2019-12-27 04:04:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13762 to 12106. [2019-12-27 04:04:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12106 states. [2019-12-27 04:04:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12106 states to 12106 states and 35067 transitions. [2019-12-27 04:04:02,624 INFO L78 Accepts]: Start accepts. Automaton has 12106 states and 35067 transitions. Word has length 41 [2019-12-27 04:04:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:02,624 INFO L462 AbstractCegarLoop]: Abstraction has 12106 states and 35067 transitions. [2019-12-27 04:04:02,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:04:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 12106 states and 35067 transitions. [2019-12-27 04:04:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 04:04:02,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:02,636 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] [2019-12-27 04:04:02,636 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1386848900, now seen corresponding path program 1 times [2019-12-27 04:04:02,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:02,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152510957] [2019-12-27 04:04:02,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:02,716 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 04:04:02,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152510957] [2019-12-27 04:04:02,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:02,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:04:02,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066549612] [2019-12-27 04:04:02,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:04:02,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:02,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:04:02,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:04:02,718 INFO L87 Difference]: Start difference. First operand 12106 states and 35067 transitions. Second operand 6 states. [2019-12-27 04:04:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:02,849 INFO L93 Difference]: Finished difference Result 11274 states and 33248 transitions. [2019-12-27 04:04:02,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:04:02,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 04:04:02,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:02,872 INFO L225 Difference]: With dead ends: 11274 [2019-12-27 04:04:02,872 INFO L226 Difference]: Without dead ends: 9070 [2019-12-27 04:04:02,873 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 04:04:02,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9070 states. [2019-12-27 04:04:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9070 to 9070. [2019-12-27 04:04:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9070 states. [2019-12-27 04:04:03,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9070 states to 9070 states and 28236 transitions. [2019-12-27 04:04:03,100 INFO L78 Accepts]: Start accepts. Automaton has 9070 states and 28236 transitions. Word has length 42 [2019-12-27 04:04:03,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:03,100 INFO L462 AbstractCegarLoop]: Abstraction has 9070 states and 28236 transitions. [2019-12-27 04:04:03,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:04:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 9070 states and 28236 transitions. [2019-12-27 04:04:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:04:03,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:03,114 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:03,114 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:03,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:03,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1128251409, now seen corresponding path program 1 times [2019-12-27 04:04:03,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:03,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942443187] [2019-12-27 04:04:03,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:03,157 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 04:04:03,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942443187] [2019-12-27 04:04:03,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:03,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:04:03,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389081850] [2019-12-27 04:04:03,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:04:03,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:03,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:04:03,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:04:03,160 INFO L87 Difference]: Start difference. First operand 9070 states and 28236 transitions. Second operand 3 states. [2019-12-27 04:04:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:03,249 INFO L93 Difference]: Finished difference Result 13366 states and 41764 transitions. [2019-12-27 04:04:03,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:04:03,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 04:04:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:03,275 INFO L225 Difference]: With dead ends: 13366 [2019-12-27 04:04:03,275 INFO L226 Difference]: Without dead ends: 13366 [2019-12-27 04:04:03,276 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 04:04:03,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-27 04:04:03,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11014. [2019-12-27 04:04:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11014 states. [2019-12-27 04:04:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11014 states to 11014 states and 34672 transitions. [2019-12-27 04:04:03,547 INFO L78 Accepts]: Start accepts. Automaton has 11014 states and 34672 transitions. Word has length 66 [2019-12-27 04:04:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:03,547 INFO L462 AbstractCegarLoop]: Abstraction has 11014 states and 34672 transitions. [2019-12-27 04:04:03,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:04:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 11014 states and 34672 transitions. [2019-12-27 04:04:03,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:04:03,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:03,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:03,560 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:03,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:03,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1486247926, now seen corresponding path program 1 times [2019-12-27 04:04:03,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:03,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667462727] [2019-12-27 04:04:03,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:03,827 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 04:04:03,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667462727] [2019-12-27 04:04:03,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:03,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:04:03,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887338817] [2019-12-27 04:04:03,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:04:03,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:03,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:04:03,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:04:03,831 INFO L87 Difference]: Start difference. First operand 11014 states and 34672 transitions. Second operand 3 states. [2019-12-27 04:04:03,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:03,925 INFO L93 Difference]: Finished difference Result 13366 states and 40402 transitions. [2019-12-27 04:04:03,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:04:03,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 04:04:03,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:03,950 INFO L225 Difference]: With dead ends: 13366 [2019-12-27 04:04:03,951 INFO L226 Difference]: Without dead ends: 13366 [2019-12-27 04:04:03,951 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 04:04:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-27 04:04:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 10822. [2019-12-27 04:04:04,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10822 states. [2019-12-27 04:04:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10822 states to 10822 states and 32790 transitions. [2019-12-27 04:04:04,155 INFO L78 Accepts]: Start accepts. Automaton has 10822 states and 32790 transitions. Word has length 66 [2019-12-27 04:04:04,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:04,155 INFO L462 AbstractCegarLoop]: Abstraction has 10822 states and 32790 transitions. [2019-12-27 04:04:04,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:04:04,155 INFO L276 IsEmpty]: Start isEmpty. Operand 10822 states and 32790 transitions. [2019-12-27 04:04:04,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:04:04,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:04,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:04,166 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:04,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:04,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2105019115, now seen corresponding path program 1 times [2019-12-27 04:04:04,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:04,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612642534] [2019-12-27 04:04:04,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:04,250 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 04:04:04,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612642534] [2019-12-27 04:04:04,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:04,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:04:04,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624503124] [2019-12-27 04:04:04,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:04:04,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:04,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:04:04,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:04:04,252 INFO L87 Difference]: Start difference. First operand 10822 states and 32790 transitions. Second operand 7 states. [2019-12-27 04:04:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:04,542 INFO L93 Difference]: Finished difference Result 20681 states and 61631 transitions. [2019-12-27 04:04:04,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:04:04,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 04:04:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:04,565 INFO L225 Difference]: With dead ends: 20681 [2019-12-27 04:04:04,565 INFO L226 Difference]: Without dead ends: 14543 [2019-12-27 04:04:04,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:04:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14543 states. [2019-12-27 04:04:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14543 to 12441. [2019-12-27 04:04:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12441 states. [2019-12-27 04:04:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12441 states to 12441 states and 37169 transitions. [2019-12-27 04:04:04,761 INFO L78 Accepts]: Start accepts. Automaton has 12441 states and 37169 transitions. Word has length 66 [2019-12-27 04:04:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:04,762 INFO L462 AbstractCegarLoop]: Abstraction has 12441 states and 37169 transitions. [2019-12-27 04:04:04,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:04:04,762 INFO L276 IsEmpty]: Start isEmpty. Operand 12441 states and 37169 transitions. [2019-12-27 04:04:04,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:04:04,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:04,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:04,775 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:04,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:04,775 INFO L82 PathProgramCache]: Analyzing trace with hash 659069437, now seen corresponding path program 2 times [2019-12-27 04:04:04,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:04,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877746430] [2019-12-27 04:04:04,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:04,827 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 04:04:04,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877746430] [2019-12-27 04:04:04,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:04,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:04:04,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120497065] [2019-12-27 04:04:04,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:04:04,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:04,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:04:04,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:04:04,829 INFO L87 Difference]: Start difference. First operand 12441 states and 37169 transitions. Second operand 3 states. [2019-12-27 04:04:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:04,919 INFO L93 Difference]: Finished difference Result 14253 states and 42667 transitions. [2019-12-27 04:04:04,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:04:04,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 04:04:04,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:04,937 INFO L225 Difference]: With dead ends: 14253 [2019-12-27 04:04:04,937 INFO L226 Difference]: Without dead ends: 14253 [2019-12-27 04:04:04,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:04:04,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14253 states. [2019-12-27 04:04:05,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14253 to 11598. [2019-12-27 04:04:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11598 states. [2019-12-27 04:04:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11598 states to 11598 states and 34911 transitions. [2019-12-27 04:04:05,120 INFO L78 Accepts]: Start accepts. Automaton has 11598 states and 34911 transitions. Word has length 66 [2019-12-27 04:04:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:05,120 INFO L462 AbstractCegarLoop]: Abstraction has 11598 states and 34911 transitions. [2019-12-27 04:04:05,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:04:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 11598 states and 34911 transitions. [2019-12-27 04:04:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:05,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:05,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:05,137 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:05,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:05,138 INFO L82 PathProgramCache]: Analyzing trace with hash -881684233, now seen corresponding path program 1 times [2019-12-27 04:04:05,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:05,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468424249] [2019-12-27 04:04:05,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:05,239 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 04:04:05,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468424249] [2019-12-27 04:04:05,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:05,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:04:05,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165617691] [2019-12-27 04:04:05,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:04:05,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:05,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:04:05,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:04:05,241 INFO L87 Difference]: Start difference. First operand 11598 states and 34911 transitions. Second operand 7 states. [2019-12-27 04:04:06,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:06,122 INFO L93 Difference]: Finished difference Result 18745 states and 54912 transitions. [2019-12-27 04:04:06,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 04:04:06,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 04:04:06,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:06,147 INFO L225 Difference]: With dead ends: 18745 [2019-12-27 04:04:06,147 INFO L226 Difference]: Without dead ends: 18745 [2019-12-27 04:04:06,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:04:06,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18745 states. [2019-12-27 04:04:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18745 to 12654. [2019-12-27 04:04:06,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12654 states. [2019-12-27 04:04:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12654 states to 12654 states and 37855 transitions. [2019-12-27 04:04:06,364 INFO L78 Accepts]: Start accepts. Automaton has 12654 states and 37855 transitions. Word has length 67 [2019-12-27 04:04:06,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:06,365 INFO L462 AbstractCegarLoop]: Abstraction has 12654 states and 37855 transitions. [2019-12-27 04:04:06,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:04:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 12654 states and 37855 transitions. [2019-12-27 04:04:06,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:06,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:06,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:06,383 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:06,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:06,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1394509299, now seen corresponding path program 2 times [2019-12-27 04:04:06,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:06,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963757570] [2019-12-27 04:04:06,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:06,444 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 04:04:06,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963757570] [2019-12-27 04:04:06,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:06,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:04:06,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888313282] [2019-12-27 04:04:06,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:04:06,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:06,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:04:06,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:04:06,446 INFO L87 Difference]: Start difference. First operand 12654 states and 37855 transitions. Second operand 4 states. [2019-12-27 04:04:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:06,548 INFO L93 Difference]: Finished difference Result 12522 states and 37296 transitions. [2019-12-27 04:04:06,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:04:06,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 04:04:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:06,564 INFO L225 Difference]: With dead ends: 12522 [2019-12-27 04:04:06,564 INFO L226 Difference]: Without dead ends: 12522 [2019-12-27 04:04:06,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 04:04:06,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12522 states. [2019-12-27 04:04:06,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12522 to 11586. [2019-12-27 04:04:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2019-12-27 04:04:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 34463 transitions. [2019-12-27 04:04:06,952 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 34463 transitions. Word has length 67 [2019-12-27 04:04:06,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:06,952 INFO L462 AbstractCegarLoop]: Abstraction has 11586 states and 34463 transitions. [2019-12-27 04:04:06,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:04:06,953 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 34463 transitions. [2019-12-27 04:04:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:06,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:06,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:06,965 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:06,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:06,965 INFO L82 PathProgramCache]: Analyzing trace with hash -825405888, now seen corresponding path program 1 times [2019-12-27 04:04:06,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:06,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500275610] [2019-12-27 04:04:06,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:07,182 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 04:04:07,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500275610] [2019-12-27 04:04:07,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:07,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:04:07,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886775344] [2019-12-27 04:04:07,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:04:07,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:07,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:04:07,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:04:07,184 INFO L87 Difference]: Start difference. First operand 11586 states and 34463 transitions. Second operand 11 states. [2019-12-27 04:04:08,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:08,163 INFO L93 Difference]: Finished difference Result 19081 states and 56507 transitions. [2019-12-27 04:04:08,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 04:04:08,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 04:04:08,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:08,188 INFO L225 Difference]: With dead ends: 19081 [2019-12-27 04:04:08,188 INFO L226 Difference]: Without dead ends: 18062 [2019-12-27 04:04:08,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-27 04:04:08,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18062 states. [2019-12-27 04:04:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18062 to 16008. [2019-12-27 04:04:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16008 states. [2019-12-27 04:04:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16008 states to 16008 states and 47601 transitions. [2019-12-27 04:04:08,435 INFO L78 Accepts]: Start accepts. Automaton has 16008 states and 47601 transitions. Word has length 67 [2019-12-27 04:04:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:08,436 INFO L462 AbstractCegarLoop]: Abstraction has 16008 states and 47601 transitions. [2019-12-27 04:04:08,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:04:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 16008 states and 47601 transitions. [2019-12-27 04:04:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:08,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:08,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:08,452 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:08,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:08,452 INFO L82 PathProgramCache]: Analyzing trace with hash 289864222, now seen corresponding path program 2 times [2019-12-27 04:04:08,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:08,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339864454] [2019-12-27 04:04:08,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:08,619 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 04:04:08,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339864454] [2019-12-27 04:04:08,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:08,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:04:08,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496434042] [2019-12-27 04:04:08,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:04:08,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:04:08,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:04:08,622 INFO L87 Difference]: Start difference. First operand 16008 states and 47601 transitions. Second operand 11 states. [2019-12-27 04:04:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:09,431 INFO L93 Difference]: Finished difference Result 18868 states and 55093 transitions. [2019-12-27 04:04:09,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 04:04:09,431 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 04:04:09,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:09,451 INFO L225 Difference]: With dead ends: 18868 [2019-12-27 04:04:09,451 INFO L226 Difference]: Without dead ends: 14416 [2019-12-27 04:04:09,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 04:04:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14416 states. [2019-12-27 04:04:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14416 to 12027. [2019-12-27 04:04:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12027 states. [2019-12-27 04:04:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12027 states to 12027 states and 35282 transitions. [2019-12-27 04:04:09,635 INFO L78 Accepts]: Start accepts. Automaton has 12027 states and 35282 transitions. Word has length 67 [2019-12-27 04:04:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:09,635 INFO L462 AbstractCegarLoop]: Abstraction has 12027 states and 35282 transitions. [2019-12-27 04:04:09,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:04:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand 12027 states and 35282 transitions. [2019-12-27 04:04:09,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:09,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:09,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:09,647 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:09,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:09,647 INFO L82 PathProgramCache]: Analyzing trace with hash -164342018, now seen corresponding path program 3 times [2019-12-27 04:04:09,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:09,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427593062] [2019-12-27 04:04:09,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:04:09,827 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 04:04:09,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427593062] [2019-12-27 04:04:09,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:04:09,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:04:09,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234804823] [2019-12-27 04:04:09,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:04:09,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:04:09,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:04:09,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:04:09,829 INFO L87 Difference]: Start difference. First operand 12027 states and 35282 transitions. Second operand 12 states. [2019-12-27 04:04:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:04:10,546 INFO L93 Difference]: Finished difference Result 14896 states and 42791 transitions. [2019-12-27 04:04:10,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 04:04:10,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 04:04:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:04:10,564 INFO L225 Difference]: With dead ends: 14896 [2019-12-27 04:04:10,565 INFO L226 Difference]: Without dead ends: 13752 [2019-12-27 04:04:10,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:04:10,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13752 states. [2019-12-27 04:04:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13752 to 11185. [2019-12-27 04:04:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11185 states. [2019-12-27 04:04:10,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11185 states to 11185 states and 32987 transitions. [2019-12-27 04:04:10,945 INFO L78 Accepts]: Start accepts. Automaton has 11185 states and 32987 transitions. Word has length 67 [2019-12-27 04:04:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:04:10,945 INFO L462 AbstractCegarLoop]: Abstraction has 11185 states and 32987 transitions. [2019-12-27 04:04:10,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:04:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 11185 states and 32987 transitions. [2019-12-27 04:04:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:04:10,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:04:10,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:04:10,957 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:04:10,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:04:10,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1080421452, now seen corresponding path program 4 times [2019-12-27 04:04:10,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:04:10,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997083310] [2019-12-27 04:04:10,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:04:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:04:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:04:11,066 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:04:11,066 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:04:11,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= v_~y$read_delayed~0_7 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2393~0.base_39|) (= v_~y$r_buff1_thd0~0_201 0) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2393~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2393~0.base_39|) |v_ULTIMATE.start_main_~#t2393~0.offset_26| 0)) |v_#memory_int_23|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2393~0.base_39| 4)) (= |v_ULTIMATE.start_main_~#t2393~0.offset_26| 0) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2393~0.base_39| 1)) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2393~0.base_39|)) (= 0 v_~y$r_buff1_thd2~0_197) (= v_~y~0_189 0) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_785, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_~#t2395~0.base=|v_ULTIMATE.start_main_~#t2395~0.base_27|, ULTIMATE.start_main_~#t2395~0.offset=|v_ULTIMATE.start_main_~#t2395~0.offset_20|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_~#t2393~0.base=|v_ULTIMATE.start_main_~#t2393~0.base_39|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ULTIMATE.start_main_~#t2394~0.offset=|v_ULTIMATE.start_main_~#t2394~0.offset_25|, ~y~0=v_~y~0_189, ULTIMATE.start_main_~#t2394~0.base=|v_ULTIMATE.start_main_~#t2394~0.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t2393~0.offset=|v_ULTIMATE.start_main_~#t2393~0.offset_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t2395~0.base, ULTIMATE.start_main_~#t2395~0.offset, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_~#t2393~0.base, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2394~0.offset, ~y~0, ULTIMATE.start_main_~#t2394~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t2393~0.offset, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 04:04:11,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_15 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|) (= 0 (mod v_~y$w_buff1_used~0_76 256))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_15, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 04:04:11,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2394~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2394~0.base_11|) |v_ULTIMATE.start_main_~#t2394~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2394~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2394~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2394~0.base_11|) (= |v_ULTIMATE.start_main_~#t2394~0.offset_10| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2394~0.base_11| 4) |v_#length_17|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2394~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2394~0.base=|v_ULTIMATE.start_main_~#t2394~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2394~0.offset=|v_ULTIMATE.start_main_~#t2394~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2394~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2394~0.offset] because there is no mapped edge [2019-12-27 04:04:11,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2395~0.base_11| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2395~0.base_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2395~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2395~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2395~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2395~0.base_11|) |v_ULTIMATE.start_main_~#t2395~0.offset_10| 2)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t2395~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2395~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2395~0.base=|v_ULTIMATE.start_main_~#t2395~0.base_11|, ULTIMATE.start_main_~#t2395~0.offset=|v_ULTIMATE.start_main_~#t2395~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t2395~0.base, ULTIMATE.start_main_~#t2395~0.offset] because there is no mapped edge [2019-12-27 04:04:11,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-235838613 256) 0))) (or (and .cse0 (= ~y$w_buff1~0_In-235838613 |P2Thread1of1ForFork2_#t~ite23_Out-235838613|) (= |P2Thread1of1ForFork2_#t~ite24_Out-235838613| |P2Thread1of1ForFork2_#t~ite23_Out-235838613|) (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-235838613 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-235838613 256)) .cse1) (and (= (mod ~y$r_buff1_thd3~0_In-235838613 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-235838613 256))))) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In-235838613| |P2Thread1of1ForFork2_#t~ite23_Out-235838613|) (= |P2Thread1of1ForFork2_#t~ite24_Out-235838613| ~y$w_buff1~0_In-235838613)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-235838613|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-235838613, ~y$w_buff1~0=~y$w_buff1~0_In-235838613, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-235838613, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-235838613, ~weak$$choice2~0=~weak$$choice2~0_In-235838613, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-235838613} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-235838613|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-235838613|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-235838613, ~y$w_buff1~0=~y$w_buff1~0_In-235838613, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-235838613, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-235838613, ~weak$$choice2~0=~weak$$choice2~0_In-235838613, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-235838613} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 04:04:11,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1287439477 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1287439477 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1287439477 256)) (and .cse0 (= (mod ~y$w_buff1_used~0_In-1287439477 256) 0)) (and .cse0 (= (mod ~y$r_buff1_thd3~0_In-1287439477 256) 0)))) (= |P2Thread1of1ForFork2_#t~ite27_Out-1287439477| |P2Thread1of1ForFork2_#t~ite26_Out-1287439477|) .cse1 (= ~y$w_buff0_used~0_In-1287439477 |P2Thread1of1ForFork2_#t~ite26_Out-1287439477|)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite27_Out-1287439477| ~y$w_buff0_used~0_In-1287439477) (= |P2Thread1of1ForFork2_#t~ite26_In-1287439477| |P2Thread1of1ForFork2_#t~ite26_Out-1287439477|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1287439477, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1287439477|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1287439477, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1287439477, ~weak$$choice2~0=~weak$$choice2~0_In-1287439477, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1287439477} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1287439477|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1287439477, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1287439477, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1287439477, ~weak$$choice2~0=~weak$$choice2~0_In-1287439477, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1287439477|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1287439477} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 04:04:11,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1020492159 256) 0))) (or (and (= ~y$w_buff1_used~0_In-1020492159 |P2Thread1of1ForFork2_#t~ite30_Out-1020492159|) (= |P2Thread1of1ForFork2_#t~ite29_In-1020492159| |P2Thread1of1ForFork2_#t~ite29_Out-1020492159|) (not .cse0)) (and (= ~y$w_buff1_used~0_In-1020492159 |P2Thread1of1ForFork2_#t~ite29_Out-1020492159|) (= |P2Thread1of1ForFork2_#t~ite29_Out-1020492159| |P2Thread1of1ForFork2_#t~ite30_Out-1020492159|) (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1020492159 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-1020492159 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-1020492159 256) 0) (and (= 0 (mod ~y$r_buff1_thd3~0_In-1020492159 256)) .cse1))) .cse0))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1020492159, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1020492159, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1020492159, ~weak$$choice2~0=~weak$$choice2~0_In-1020492159, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-1020492159|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1020492159} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1020492159, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1020492159, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1020492159|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1020492159, ~weak$$choice2~0=~weak$$choice2~0_In-1020492159, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1020492159|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1020492159} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 04:04:11,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_10|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 04:04:11,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 04:04:11,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2141445299 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-2141445299 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-2141445299 |P2Thread1of1ForFork2_#t~ite38_Out-2141445299|)) (and (= |P2Thread1of1ForFork2_#t~ite38_Out-2141445299| ~y$w_buff1~0_In-2141445299) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2141445299, ~y$w_buff1~0=~y$w_buff1~0_In-2141445299, ~y~0=~y~0_In-2141445299, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2141445299} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2141445299, ~y$w_buff1~0=~y$w_buff1~0_In-2141445299, ~y~0=~y~0_In-2141445299, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-2141445299|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2141445299} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 04:04:11,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-478405689 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-478405689 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-478405689| ~y$w_buff0_used~0_In-478405689) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-478405689| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-478405689, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-478405689} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-478405689|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-478405689, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-478405689} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 04:04:11,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1008733078 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1008733078 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1008733078 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In1008733078 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1008733078|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1008733078 |P0Thread1of1ForFork0_#t~ite6_Out1008733078|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1008733078, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1008733078, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1008733078, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1008733078} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1008733078|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1008733078, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1008733078, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1008733078, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1008733078} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 04:04:11,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1091858512 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1091858512 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-1091858512| |P1Thread1of1ForFork1_#t~ite10_Out-1091858512|))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork1_#t~ite9_Out-1091858512| ~y~0_In-1091858512)) (and (not .cse1) (not .cse2) .cse0 (= ~y$w_buff1~0_In-1091858512 |P1Thread1of1ForFork1_#t~ite9_Out-1091858512|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1091858512, ~y$w_buff1~0=~y$w_buff1~0_In-1091858512, ~y~0=~y~0_In-1091858512, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1091858512} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1091858512, ~y$w_buff1~0=~y$w_buff1~0_In-1091858512, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1091858512|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1091858512|, ~y~0=~y~0_In-1091858512, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1091858512} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 04:04:11,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_12|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_12|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_7|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_11|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 04:04:11,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1502620491 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1502620491 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out1502620491| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite40_Out1502620491| ~y$w_buff0_used~0_In1502620491) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1502620491, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1502620491} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1502620491, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1502620491, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1502620491|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 04:04:11,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-2056895121 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2056895121 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-2056895121 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-2056895121 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite41_Out-2056895121| ~y$w_buff1_used~0_In-2056895121) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-2056895121|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2056895121, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2056895121, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2056895121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2056895121} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2056895121, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2056895121, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-2056895121|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2056895121, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2056895121} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 04:04:11,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In914685304 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In914685304 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out914685304|)) (and (= ~y$r_buff0_thd3~0_In914685304 |P2Thread1of1ForFork2_#t~ite42_Out914685304|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In914685304, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In914685304} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In914685304, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out914685304|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In914685304} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 04:04:11,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1293430532 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1293430532 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1293430532 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1293430532 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1293430532 |P2Thread1of1ForFork2_#t~ite43_Out1293430532|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite43_Out1293430532| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1293430532, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1293430532, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1293430532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1293430532} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1293430532, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1293430532, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1293430532, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1293430532|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1293430532} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 04:04:11,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2139100110 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-2139100110 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-2139100110 0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In-2139100110 ~y$r_buff0_thd1~0_Out-2139100110) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139100110, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2139100110} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139100110, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2139100110|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2139100110} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 04:04:11,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In755544644 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In755544644 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In755544644 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In755544644 256) 0))) (or (and (= ~y$r_buff1_thd1~0_In755544644 |P0Thread1of1ForFork0_#t~ite8_Out755544644|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out755544644|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In755544644, ~y$w_buff0_used~0=~y$w_buff0_used~0_In755544644, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In755544644, ~y$w_buff1_used~0=~y$w_buff1_used~0_In755544644} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In755544644, ~y$w_buff0_used~0=~y$w_buff0_used~0_In755544644, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out755544644|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In755544644, ~y$w_buff1_used~0=~y$w_buff1_used~0_In755544644} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 04:04:11,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 04:04:11,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_34| v_~y$r_buff1_thd3~0_152) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_33|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 04:04:11,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1466819903 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1466819903 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1466819903 |P1Thread1of1ForFork1_#t~ite11_Out1466819903|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1466819903|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1466819903, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1466819903} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1466819903, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1466819903, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1466819903|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 04:04:11,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1230867098 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1230867098 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1230867098 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1230867098 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1230867098 |P1Thread1of1ForFork1_#t~ite12_Out1230867098|)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out1230867098| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1230867098, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1230867098, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1230867098, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1230867098} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1230867098, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1230867098, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1230867098, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1230867098|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1230867098} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 04:04:11,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-503455668 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-503455668 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-503455668| 0)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-503455668| ~y$r_buff0_thd2~0_In-503455668) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-503455668, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-503455668} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-503455668, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-503455668, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-503455668|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 04:04:11,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In419879123 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In419879123 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In419879123 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In419879123 256)))) (or (and (= ~y$r_buff1_thd2~0_In419879123 |P1Thread1of1ForFork1_#t~ite14_Out419879123|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out419879123|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In419879123, ~y$w_buff0_used~0=~y$w_buff0_used~0_In419879123, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In419879123, ~y$w_buff1_used~0=~y$w_buff1_used~0_In419879123} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In419879123, ~y$w_buff0_used~0=~y$w_buff0_used~0_In419879123, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In419879123, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out419879123|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In419879123} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 04:04:11,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 04:04:11,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 04:04:11,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1678344298 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1678344298 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In1678344298 |ULTIMATE.start_main_#t~ite47_Out1678344298|)) (and (= ~y$w_buff1~0_In1678344298 |ULTIMATE.start_main_#t~ite47_Out1678344298|) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1678344298, ~y~0=~y~0_In1678344298, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1678344298, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1678344298} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1678344298, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1678344298|, ~y~0=~y~0_In1678344298, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1678344298, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1678344298} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 04:04:11,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-27 04:04:11,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1121902342 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1121902342 256) 0))) (or (and (= ~y$w_buff0_used~0_In1121902342 |ULTIMATE.start_main_#t~ite49_Out1121902342|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out1121902342|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1121902342, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1121902342} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1121902342, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1121902342, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1121902342|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 04:04:11,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1090943421 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1090943421 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1090943421 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1090943421 256)))) (or (and (= ~y$w_buff1_used~0_In-1090943421 |ULTIMATE.start_main_#t~ite50_Out-1090943421|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite50_Out-1090943421| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1090943421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1090943421, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1090943421, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1090943421} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1090943421|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1090943421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1090943421, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1090943421, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1090943421} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 04:04:11,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2073885969 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-2073885969 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-2073885969|)) (and (= ~y$r_buff0_thd0~0_In-2073885969 |ULTIMATE.start_main_#t~ite51_Out-2073885969|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2073885969, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2073885969} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-2073885969|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2073885969, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2073885969} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 04:04:11,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-861207924 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-861207924 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-861207924 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-861207924 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-861207924| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out-861207924| ~y$r_buff1_thd0~0_In-861207924) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-861207924, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-861207924, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-861207924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-861207924} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-861207924|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-861207924, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-861207924, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-861207924, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-861207924} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 04:04:11,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= 2 v_~x~0_130) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 04:04:11,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:04:11 BasicIcfg [2019-12-27 04:04:11,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:04:11,192 INFO L168 Benchmark]: Toolchain (without parser) took 173546.98 ms. Allocated memory was 138.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 102.4 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 04:04:11,192 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 04:04:11,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.81 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.9 MB in the beginning and 156.0 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 04:04:11,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.27 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 04:04:11,194 INFO L168 Benchmark]: Boogie Preprocessor took 39.89 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 150.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 04:04:11,194 INFO L168 Benchmark]: RCFGBuilder took 831.90 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 101.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-27 04:04:11,195 INFO L168 Benchmark]: TraceAbstraction took 171825.49 ms. Allocated memory was 202.4 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 100.6 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 04:04:11,197 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.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.81 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.9 MB in the beginning and 156.0 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.27 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.89 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 150.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 831.90 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 101.3 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 171825.49 ms. Allocated memory was 202.4 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 100.6 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 252 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 241 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 78269 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L815] FCALL, FORK 0 pthread_create(&t2393, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L736] 1 y$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2394, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2395, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 3 __unbuffered_p2_EAX = x [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 y$flush_delayed = weak$$choice2 [L779] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=0] [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 171.4s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 54.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5176 SDtfs, 7042 SDslu, 13887 SDs, 0 SdLazy, 6611 SolverSat, 274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 41 SyntacticMatches, 22 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206903occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 91.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 179935 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1155 NumberOfCodeBlocks, 1155 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1060 ConstructedInterpolants, 0 QuantifiedInterpolants, 168095 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...